Speeding up the cyclic edit distance using LAESA with early abandon
Ver/ Abrir
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
Speeding up the cyclic edit distance using LAESA with early abandonFecha de publicación
2015Editor
ElsevierISSN
0167-8655Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://www.sciencedirect.com/science/article/pii/S0167865515001300Versión
info:eu-repo/semantics/submittedVersionPalabras clave / Materias
Resumen
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
... [+]
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 [-]
Publicado en
Pattern Recognition Letters 62 (2015) 1–7Derechos de acceso
© 2015 Elsevier B.V. All rights reserved.
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- INIT_Articles [754]
- LSI_Articles [366]