Approximating the longest approximate common subsequence problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximating the longest approximate common subsequence problem

Full text

Pdf (689 KB)

Source

ACM Southeast Regional Conference archive
Proceedings of the 36th annual Southeast regional conference table of contents

Pages: 166 - 172

Year of Publication: 1998

ISBN:1-58113-030-9

Authors

Wen-Chen Hu	Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida
Gerhard X. Ritter	Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida
Mark S. Schmalz	Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 15, Citation Count: 0

Additional Information:

references 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/275295.283951 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	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	2	Daniel S. Hirschberg, Algorithms for the Longest Common Subsequence Problem, Journal of the ACM (JACM), v.24 n.4, p.664-675, Oct. 1977 [doi>10.1145/322033.322044]
	3	JJ. Hopfield. Neurons with graded response have collective computational, pmpertie.,s like those of twostate neurons. In Proceedings of the National Academy of Science, 81:3088--3092, 1984.
	4	R. Karp. Reducibility among combinatorial problems. In R. Miller and J. 'lYagher, editors, In Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
	5	Robert A. Wagner, On the complexity of the Extended String-to-String Correction Problem, Proceedings of seventh annual ACM symposium on Theory of computing, p.218-223, May 05-07, 1975, Albuquerque, New Mexico, United States [doi>10.1145/800116.803771]
	6	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]