Chaining Algorithms for Alignment of Draft Sequence
In this paper we propose a chaining method that can align a draft genomic sequence against a finished genome. We introduce the use of an overlap tree to enhance the state information available to the chaining procedure in the context of sparse dynamic programming, and demonstrate that the resulting procedure more accurately penalizes the various biological rearrangements. The algorithm is tested on a whole genome alignment of seven yeast species. We also demonstrate a variation on the algorithm that can be used for co-assembly of two genomes and show how it can improve the current assembly of the Ciona savignyi (sea squirt) genome.
KeywordsLocal Alignment Global Alignment Genome Alignment Draft Sequence Binary Search Tree
Unable to display preview. Download preview PDF.
- Brudno, M., Morgenstern, B.: Fast and sensitive alignment of large genomic sequences. In: Proceedings of the IEEE Computer Society Bioinformatics Conference CSB (2002)Google Scholar
- Lippert, R.A., Zhao, X., Florea, L., Mobarry, C., Istrail, S.: Finding Anchors for Genomic Sequence Comparison. In: Proceedings of ACM RECOMB (2004)Google Scholar