Post-processing long pairwise alignments
Lists
Only you see this
Abstract
We develop an algorithm that decomposes a long alignment into sub-alignments that avoid these potential imperfections. Our algorithm runs in time proportional to the original alignment's length. Practical applications to alignments of genomic DNA sequences are described.
BibTeX
@article{zhang1999post,
author = {Zheng Zhang and Piotr Berman and Thomas Wiehe and Webb Miller},
title = {{Post-processing long pairwise alignments}},
journal = {Bioinformatics},
year = {1999},
doi = {10.1093/bioinformatics/15.12.1012},
}Loading related content...