ReAligner: A Program for Refining DNA Sequence Multi-Alignments
- 1 January 1997
- journal article
- research article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 4 (3) , 369-383
- https://doi.org/10.1089/cmb.1997.4.369
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. Key words: fragment assembly, round-robin realignment, multiple alignment, consensus score/ sequenceKeywords
This publication has 9 references indexed in Scilit:
- CLUSTAL: a package for performing multiple sequence alignment on a microcomputerPublished by Elsevier ,2003
- An Improved Sequence Assembly ProgramGenomics, 1996
- Hidden Markov Models in Computational BiologyJournal of Molecular Biology, 1994
- The accuracy of DNA sequences: Estimating sequence qualityGenomics, 1992
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- Multiple sequence alignment with hierarchical clusteringNucleic Acids Research, 1988
- A strategy for the rapid multiple alignment of protein sequencesJournal of Molecular Biology, 1987
- Progressive sequence alignment as a prerequisitetto correct phylogenetic treesJournal of Molecular Evolution, 1987
- Line geometries for sequence comparisonsBulletin of Mathematical Biology, 1984