A fast algorithm for determining the best combination of local alignments to a query sequenceReportar como inadecuado




A fast algorithm for determining the best combination of local alignments to a query sequence - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

BMC Bioinformatics

, 5:62

First Online: 18 May 2004Received: 15 November 2003Accepted: 18 May 2004

Abstract

BackgroundExisting 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.

ResultsWe 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 On time, where n is the number of local alignments considered.

ConclusionsWe discuss two example applications of the algorithm. The algorithm is able to provide useful reconstructions of the metazoan mitochondrial genome. It is also able to increase the percentage of a query sequence-s amino acid residues for which similar stretches of amino acids can be found in sequence databases.

Keywordslocal alignment alignment combination AbbreviationsOAC O ptimal A lignment C ombination

Electronic supplementary materialThe online version of this article doi:10.1186-1471-2105-5-62 contains supplementary material, which is available to authorized users.

Download fulltext PDF



Autor: Gavin C Conant - Andreas Wagner

Fuente: https://link.springer.com/



DESCARGAR PDF




Documentos relacionados