Name
Abstract | ||
|---|---|---|
We derive a time-efficient method for building a multiple alignment consisting of a highest-scoring chain of "blocks," i.e., short gap-free alignments. Besides executing faster than a general-purpose multiple-alignment program, the method may be particularly appropriate when discovery of blocks meeting a certain criterion is the main reason for aligning the sequences. Utility of the method is illustrated by locating a chain of "phylogenetic footprints" (specifically, exact matches of length 6 or more) in the 5'-flanking regions of six mammalian epsilon-globin genes. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1089/cmb.1994.1.217 | Journal of Computational Biology |
Keywords | Field | DocType |
multiple alignment | Chaining,Phylogenetic tree,Flanking maneuver,Computer science,Theoretical computer science,Bioinformatics,Multiple sequence alignment | Journal |
Volume | Issue | ISSN |
1 | 3 | 1066-5277 |
Citations | PageRank | References |
16 | 1.55 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Z Zhang | 1 | 107 | 21.41 |
| Balaji Raghavachari | 2 | 1001 | 77.77 |
| R C Hardison | 3 | 182 | 39.09 |
| W Miller | 4 | 1301 | 295.71 |