Circular sequence comparison: algorithms and applications - Archive ouverte HAL Access content directly
Journal Articles Algorithms for Molecular Biology Year : 2016

Circular sequence comparison: algorithms and applications

(1, 2) , (3) , (3) , (1, 2) , (4) , (3) , (3)
1
2
3
4

Abstract

Background Sequence comparison is a fundamental step in many important tasks in bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes. Traditional algorithms for measuring approximation in sequence comparison are based on the notions of distance or similarity, and are generally computed through sequence alignment techniques. As circular molecular structure is a common phenomenon in nature, a caveat of the adaptation of alignment techniques for circular sequence comparison is that they are computationally expensive, requiring from super-quadratic to cubic time in the length of the sequences. Results In this paper, we introduce a new distance measure based on q-grams, and show how it can be applied effectively and computed efficiently for circular sequence comparison. Experimental results, using real DNA, RNA, and protein sequences as well as synthetic data, demonstrate orders-of-magnitude superiority of our approach in terms of efficiency, while maintaining an accuracy very competitive to the state of the art.
Fichier principal
Vignette du fichier
Almob16.pdf (1.94 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01388449 , version 1 (30-05-2017)

Licence

Attribution - ShareAlike - CC BY 4.0

Identifiers

Cite

Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, et al.. Circular sequence comparison: algorithms and applications. Algorithms for Molecular Biology, 2016, 11 (1), pp.1-14. ⟨10.1186/s13015-016-0076-6⟩. ⟨hal-01388449⟩

Collections

INRIA INRIA2
93 View
244 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More