Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Approximation algorithms for multiple sequence alignment
Bafna V., Lawler E., Pevzner P. Theoretical Computer Science182 (1-2):233-244,1997.Type:Article
Date Reviewed: Apr 1 1998

Interspecies relationships, the ongoing human genome project, and the accelerating interest in genetic engineering for disease control have generated a parallel activity in computational genetics. This paper considers the problem of aligning protein sequences between several source chains. The authors develop an algorithm with guaranteed performance 2 - 1 &slash; k where k is the number of sequences of length n. A short fragment of pseudocode that implements the method is provided.

Reviewer:  K. Booth Review #: CR121258 (9804-0257)
Bookmark and Share
 
Counting Problems (G.2.1 ... )
 
 
Pattern Matching (F.2.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Counting Problems": Date
Enumeration of polyominoes using MACSYMA
Delest M. (ed) Theoretical Computer Science 79(1): 209-226, 1991. Type: Article
Nov 1 1992
On counting lattice points in polyhedra
Dyer M. SIAM Journal on Computing 20(4): 695-707, 1991. Type: Article
Aug 1 1992
Partially ordered sets and sorting
Atkinson M.  Computers in mathematical research (, Cardiff, Wales,1761988. Type: Proceedings
May 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy