Abstract
We derive a time-efficient method for building a multiple alignment consisting of a highestscoring 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 ε-globin genes.
Original language | English (US) |
---|---|
Pages (from-to) | 217-226 |
Number of pages | 10 |
Journal | Journal of Computational Biology |
Volume | 1 |
Issue number | 3 |
DOIs | |
State | Published - 1994 |
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Molecular Biology
- Genetics
- Computational Mathematics
- Computational Theory and Mathematics