Circular Sequence Comparison with q-grams - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Circular Sequence Comparison with q-grams

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

Abstract

Sequence comparison is a fundamental step in many important tasks in bioinformatics. 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 genome structure is a common phenomenon in nature, a caveat of specialized 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. In this paper , we introduce a new distance measure based on q-grams, and show how it can be computed efficiently for circular sequence comparison. Experimental results, using real and 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
WABI15.pdf (382.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01246271 , version 1 (18-12-2015)
hal-01246271 , version 2 (23-05-2017)

Identifiers

Cite

Robert P Grossi, Costas S Iliopoulos, Robert Mercas, Nadia P Pisanti, Solon P Pissis, et al.. Circular Sequence Comparison with q-grams. 15th International Workshop on Algorithms in Bioinformatics (WABI 2015), Sep 2015, Atlanta, United States. pp.203 - 216, ⟨10.1007/978-3-662-48221-6_15⟩. ⟨hal-01246271v2⟩

Collections

INRIA INRIA2
510 View
184 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More