Circular sequence comparison: algorithms and applications

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.
Type de document :
Article dans une revue
Algorithms for Molecular Biology, BioMed Central, 2016, 11 (1), 〈10.1186/s13015-016-0076-6〉
Liste complète des métadonnées

Littérature citée [51 références]  Voir  Masquer  Télécharger
Contributeur : Marie-France Sagot <>
Soumis le : mardi 30 mai 2017 - 13:43:43
Dernière modification le : mardi 26 février 2019 - 10:54:02
Document(s) archivé(s) le : mercredi 6 septembre 2017 - 13:30:18


Fichiers éditeurs autorisés sur une archive ouverte




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



Consultations de la notice


Téléchargements de fichiers