King's College London

Research portal

A faster and more accurate heuristic for cyclic edit distance computation

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)81-87
Early online date24 Jan 2017
Accepted/In press23 Jan 2017
E-pub ahead of print24 Jan 2017
Published1 Mar 2017


King's Authors


Sequence comparison is the core computation of many applications involving textual representations of data. Edit distance is the most widely used measure to quantify the similarity of two sequences. Edit distance can be defined as the minimal total cost of a sequence of edit operations to transform one sequence into the other; for a sequence x of length m and a sequence y of length n, it can be computed in time O ( m n ) . In many applications, it is common to consider sequences with circular structure: for instance, the orientation of two images or the leftmost position of two linearised circular DNA sequences may be irrelevant. To this end, an algorithm to compute the cyclic edit distance in time O ( m n log m ) was proposed (Maes, Inf. Proc. Let. 2003) and several heuristics have been proposed to speed up this computation. Recently, a new algorithm based on q-grams was proposed for circular sequence comparison (Grossi et al., Algorithms Mol Biol. 2016). We extend this algorithm for cyclic edit distance computation and show that this new heuristic is faster and more accurate than the state of the art. The aim of this letter is to give visibility to this idea in the pattern recognition community.

Download statistics

No data available

View graph of relations

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454