2024-03-29T06:05:38Zhttps://repositori.uji.es/oai/requestoai:repositori.uji.es:10234/1599842021-06-11T16:28:40Zcom_10234_43662com_10234_9com_10234_7038col_10234_43643col_10234_8634
00925njm 22002777a 4500
dc
Palazón González, Vicente
author
Marzal Varó, Andrés
author
2015
The cyclic edit distance between two strings is the minimum edit distance between one of this strings and
every possible cyclic shift of the other. This can be useful, for example, in image analysis where strings
describe the contour of shapes or in computational biology for classifying circular permuted proteins or
circular DNA/RNA molecules. The cyclic edit distance can be computed in O(mnlog m) time, however, in real
recognition tasks this is a high computational cost because of the size of databases. A method to reduce
the number of comparisons and avoid an exhaustive search is convenient. In this work, we present a new
algorithm based on a modification of LAESA (linear approximating and eliminating search algorithm) for
applying pruning in the computation of distances. It is an efficient procedure for classification and retrieval
of cyclic strings. Experimental results show that our proposal considerably outperforms LAESA
0167-8655
http://hdl.handle.net/10234/159984
http://dx.doi.org/10.1016/j.patrec.2015.04.013
Cyclic strings
Cyclic edit distance
AESA
LAESA
Shape recognition
Circular permuted proteins
Circular DNA/RNA
Speeding up the cyclic edit distance using LAESA with early abandon