Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Eric L. Anson
ID Genomics (United States)
Eugene W. Myers
Okinawa Institute of Science and Technology Graduate University
Journal of Computational Biology
University of Arizona
Building similarity graph...
Analyzing shared references across papers
Loading...
Anson et al. (Wed,) studied this question.
synapsesocial.com/papers/6a1c7db92cc291e7bf2fdc96 — DOI: https://doi.org/10.1089/cmb.1997.4.369
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: