Edit distance of run-length coded strings

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Edit distance of run-length coded strings

Full text

Pdf (615 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's table of contents

Kansas City, Missouri, United States

Pages: 137 - 143

Year of Publication: 1992

ISBN:0-89791-502-X

Authors

H. Bunke
J. Csirik

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 13, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/143559.143625 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Robert A. Wagner , Michael J. Fischer, The String-to-String Correction Problem, Journal of the ACM (JACM), v.21 n.1, p.168-173, Jan. 1974 [doi>10.1145/321796.321811]
	2	Levensthtein, V. I.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory, Vol. 10, No. 8, 1966, 707-710.
	3	Masek, W. J./Paterson, M.S.: A faster algorithm for comparing string-edit distances. Journal of Computer and System Sciences, Vol. 20, No 1, 1980, 18- 31.
	4	James W. Hunt , Thomas G. Szymanski, A fast algorithm for computing longest common subsequences, Communications of the ACM, v.20 n.5, p.350-353, May 1977 [doi>10.1145/359581.359603]
	5	Myers, E.W.: An O(ND) difference algorithm and its variations. Algorithmica, Vol. 1, 1986, 251-266.
	6	Esko Ukkonen, Algorithms for approximate string matching, Information and Control, v.64 n.1-3, p.100-118, Jan./Feb./March 1985 [doi>10.1016/S0019-9958(85)80046-2]
	7	Alfred V. Aho, Algorithms for finding patterns in strings, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991
	8	Sankoff, D./Kruskai, J.B. (eds.): Time warps, string edits, and macromolecules; the theory and practice of sequence comparsion. Addison Wesley Publ. Co., Reading, Ma., 1983.
	9	Maurice Maes, Polygonal shape recognition using string-matching techniques, Pattern Recognition, v.24 n.5, p.433-440, 1991 [doi>10.1016/0031-3203(91)90056-B]
	10	Wang, Y.P./Pavlidis, T.: Optimal correspondences of string subsequences. In Baird, Fi. (ed.): SSPR 90, Preproceedings International Association for Pattern Recognition Workshop on Syntactic and Structural Pattern Recognition, Murray Hill, New Jersey, 1990, 460-479.
	11	A. Margalit , A. Rosenfeld, Reducing the expected computational cost of template matching using run length representation, Pattern Recognition Letters, v.11 n.4, p.255-265, Apr. 1990 [doi>10.1016/0167-8655(90)90064-9]