| Literature DB >> 9278066 |
Abstract
We present a round-robin realignment algorithm that improves a potentially crude initial alignment of an assembled collection of DNA sequence fragments, as might, for example, be output by a typical fragment assembly program. The algorithm uses a weighted combination of two scoring schemes to achieve superior multi-alignments, and employs a banded dynamic programming variation to achieve a running time that is linear in the amount of sequence in the data set. We demonstrate that the algorithm improves upon the alignments produced by other assembly programs in a series of empirical experiments on simulated data. Finally, we present a pair of programs embodying the algorithms that are available from the Web site ftp://ftp.cs.arizona.edu/realigner.Entities:
Mesh:
Substances:
Year: 1997 PMID: 9278066 DOI: 10.1089/cmb.1997.4.369
Source DB: PubMed Journal: J Comput Biol ISSN: 1066-5277 Impact factor: 1.479