Circular Sequence Comparison with q-grams

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01246271
Contributor : Marie-France Sagot <>
Submitted on : Tuesday, May 23, 2017 - 12:19:28 PM
Last modification on : Tuesday, February 26, 2019 - 10:54:02 AM
Long-term archiving on : Friday, August 25, 2017 - 12:48:15 AM

File

WABI15.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Robert Grossi, Costas Iliopoulos, Robert Mercas, Nadia Pisanti, Solon 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⟩

Share

Metrics

Record views

495

Files downloads

187