Abstract
Many pattern recognition problems require the evaluation of a measure of similarity between two strings of symbols. Applications range from molecular biology to speech and image analysis [13].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Bunke and U. Bühler, Applications of Approximate String Matching to 2D Shape Recognition, Pattern Recognition Vol. 26 No. 12 (1993) pp. 1797–1812.
H. Freeman, Computer Processing of Line Drawing Images, Computer Surveys, Vol. 6 (1974) pp. 57–98.
J. Gregor and M. G. Thomason, Dynamic Programming Alignment of Sequences Representing Cyclic Patterns, IEEE Transactions on Pattern Analysis and Machine IntelligenceVol. 15 No. 2 (1993) pp. 129–135.
D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, (Cambridge University Press, 1997 ).
R. C. Gonzalez and R. E. Woods, Digital Image Processing, (Addison-Wesley, 1992 ).
V. I. Levenshtein, Binary Codes Capable of Correcting Deletions, Insertions and Reversals, Cybernetics and Control TheoryVol. 10 No. 8 (1966) pp. 707–710.
M. Maes, On a Cyclic String-to-String Correction Problem, Information Processing LetterVol. 35 No. 2 (1990) pp. 73–78.
A. Marzal and S. Barrachina, Speeding Up the Computation of the Edit Distance for Cyclic Strings, Proceedings of 15th International Conference on Pattern RecognitionVol. 2 (Barcelona, Spain, IEEE Computer Society, 2000 ) pp. 895–898.
A. Marzal and G. Penis, Dependencia del cálculo de la distancia de edición cíclica con las funciones de coste, Internal Report DLSI 01–02/01, Universitat Jaume I, Spain. (In Spanish.)
R. Mollineda, Técnicas de Agrupamiento Jerárquico para la Selecciòn de Prototipos y Clasificaciòn basadas en Distancias. Uso en Cadenas Céclicas, Ph.D. Dissertation. Universidad Politícnica de Valencia, Spain, 2001. (In Spanish.)
R. A. Mollineda, E. Vidal and F. Casacuberta, Efficient Techniques for a Very Accurate Measurement of Dissimilarities between Cyclic Patterns, Lecture Notes in Comp. Science Vol. 1876 (Springer, 2000 ) pp. 337–346.
G. Penis and A. Marzal, Fast Computation of Cyclic Edit Distances: Dependence on the Cost Functions, Pattern Recognition and Image Analysis. Proceedings of the IX Spanish Symposium on Pattern Recognition and Image Analysis. Vol. 1, Universitat Jaume I, Spain (2001) pp. 121–126.
D. Sankoff and J. B. Kruskal, Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparisson, (Addison-Wesley, 1983 ).
P. H. Sellers, The Theory and Computation of Evolutionary Distances: Pattern Recognition, Journal of AlgorithmsVol. 1 (1980) pp. 359–373.
R. A. Wagner and M. J. Fischer, The String-to-String Correction Problem, Journal of ACMVol. 21 No. 1 (1974) pp. 168–173.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Marzal, A., Mollineda, R., Penis, G., Vidal, E. (2003). Cyclic String Matching: Efficient Exact and Approximate Algorithms. In: Chen, D., Cheng, X. (eds) Pattern Recognition and String Matching. Combinatorial Optimization, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0231-5_19
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0231-5_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7952-2
Online ISBN: 978-1-4613-0231-5
eBook Packages: Springer Book Archive