Splign: algorithms for computing spliced alignments with identification of paralogs

Biology Direct. 2008;3(1):20 DOI 10.1186/1745-6150-3-20


Journal Homepage

Journal Title: Biology Direct

ISSN: 1745-6150 (Online)

Publisher: BMC

LCC Subject Category: Science: Biology (General)

Country of publisher: United Kingdom

Language of fulltext: English

Full-text formats available: PDF, HTML



Tatusova Tatiana

Souvorov Alexander

Kapustin Yuri

Lipman David


Open peer review

Editorial Board

Instructions for authors

Time From Submission to Publication: 9 weeks


Abstract | Full Text

<p>Abstract</p> <p>Background</p> <p>The computation of accurate alignments of cDNA sequences against a genome is at the foundation of modern genome annotation pipelines. Several factors such as presence of paralogs, small exons, non-consensus splice signals, sequencing errors and polymorphic sites pose recognized difficulties to existing spliced alignment algorithms.</p> <p>Results</p> <p>We describe a set of algorithms behind a tool called Splign for computing cDNA-to-Genome alignments. The algorithms include a high-performance preliminary alignment, a compartment identification based on a formally defined model of adjacent duplicated regions, and a refined sequence alignment. In a series of tests, Splign has produced more accurate results than other tools commonly used to compute spliced alignments, in a reasonable amount of time.</p> <p>Conclusion</p> <p>Splign's ability to deal with various issues complicating the spliced alignment problem makes it a helpful tool in eukaryotic genome annotation processes and alternative splicing studies. Its performance is enough to align the largest currently available pools of cDNA data such as the human EST set on a moderate-sized computing cluster in a matter of hours. The duplications identification (compartmentization) algorithm can be used independently in other areas such as the study of pseudogenes.</p> <p>Reviewers</p> <p>This article was reviewed by: Steven Salzberg, Arcady Mushegian and Andrey Mironov (nominated by Mikhail Gelfand).</p>