Sciweavers

Share
BMCBI
2004

A fast algorithm for determining the best combination of local alignments to a query sequence

10 years 2 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or amino acids are in the same order in both sequences. Recombination perturbs this order. An algorithm that can reconstruct sequence similarity despite rearrangement would be helpful for reconstructing the evolutionary history of recombined sequences. Results: We propose a graph-based algorithm for combining multiple local alignments to a query sequence into the single combination of alignments that either covers the maximal portion of the query or results in the single highest alignment score to the query. This algorithm can help study the process of genome rearrangement, improve functional gene annotation, and reconstruct the evolutionary history of recombined proteins. The algorithm takes O(n2) time, where n is the number of local alignments considered. Conclusions: We discuss two example applications of the...
Gavin C. Conant, Andreas Wagner
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2004
Where BMCBI
Authors Gavin C. Conant, Andreas Wagner
Comments (0)
books