@inbook{f6d7742141e14c24affcc933be5aa2b1,
title = "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.",
author = "Roberto Grossi and Iliopoulos, {Costas S.} and Robert Merca{\c s} and Nadia Pisanti and Solon Pissis and Ahmad Retha and Fatima Vayani",
year = "2015",
month = aug,
day = "28",
doi = "10.1007/978-3-662-48221-6_15",
language = "English",
isbn = "978-3-662-48220-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer Berlin Heidelberg",
pages = "203--216",
editor = "Mihai Pop and H{\'e}l{\`e}ne Touzet",
booktitle = "Algorithms in Bioinformatics",
}