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

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

<p>Abstract</p> <p>Background</p> <p>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...

Full description

Bibliographic Details
Main Authors: Wagner Andreas, Conant Gavin C
Format: Article
Language:English
Published: BMC 2004-05-01
Series:BMC Bioinformatics
Subjects:
local alignment
alignment combination
Online Access:http://www.biomedcentral.com/1471-2105/5/62

Internet

http://www.biomedcentral.com/1471-2105/5/62

Similar Items