Algorithms for the Longest Common Subsequence Problem

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	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	J. D. Ullman , A. V. Aho , D. S. Hirschberg, Bounds on the Complexity of the Longest Common Subsequence Problem, Journal of the ACM (JACM), v.23 n.1, p.1-12, Jan. 1976 [doi>10.1145/321921.321922]
	3	ARLAZAROV, V L., DINIc, E A, K~ONROD, M A, AND FAaADZEV, I A On economic construction of the trans~tive closure of a dtrected graph Dokl Akad Nauk SSSR 194 (1970), 487-488 (m Russian) English transl Jn Sorter Math Dokl 11, 5 (1970), 1209-1210
	4	Vaclav Chvatal , David A. Klarner , Donald E. Knuth, Selected combinatorial research problems., Stanford University, Stanford, CA, 1972
	5	Vaclav Chvatal , David Sankoff, Longest common subsequences of two random sequences., Stanford University, Stanford, CA, 1975
	6	HIRSCnaER6, D S On finding maximal common subsequences TR-156, Comptr Sci Lab, Princeton U, Princeton, N.J , Aug 1974
	7	D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Communications of the ACM, v.18 n.6, p.341-343, June 1975 [doi>10.1145/360825.360861]
	8	HIRSC/tBERC;, D S The longest common subsequence problem Ph D Th, Pnnceton U, Princeton, NJ,Aug 1975
	9	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]
	10	KNtJTrt, D E The Art of Computer Programming, Vol 1. Fundamental Algortthms Addison-Wesley, Reading, Mass., sec. ed , 1973
	11	Ksua'n, D. E The Art of Computer Programming, Vol 3" Sorting and Searching. Addison-Wesley, Reading, Mass., 1973
	12	Robert A. Wagner , Roy Lowrance, An Extension of the String-to-String Correction Problem, Journal of the ACM (JACM), v.22 n.2, p.177-183, April 1975 [doi>10.1145/321879.321880]
	13	NEEDLEMAN, S B , AND WUNSCH, C D A general method apphcable to the search for slmdanties m the amino acld sequence of two proteins J. Mol Biology 48 (1970), 443-453
	14	PATERSON, M.S Unpubhshed manuscript U of Warwick, Coventry, England, 1974
	15	SANKOFF, D Matching sequences under deletion/insertion constraints Proc Nat Acad Sct USA 69, 1 (Jan 1974), 4-6
	16	SELLERS, P H An algorithm for the d~stance between two finite sequences J. Combmatortal Theory, Set A, 16 (1974), 253-258
	17	SZVMANSKI, T G A special case of the maxtmal common subsequence problem TR-170, Comptr Scl Lab , Princeton U, Princeton, N J , Jan 1975.
	18	VAN EraoE BOAS, P An O(n log log n) on-hne algorithm for the insert-extract mm problem TR 74- 221, Dept Comptr Sc~, CorneU U , Ithaca, N Y, Dec 1974
	19	VAN EMOE BOAS, P. Preserving order m a forest in less than logarithmic time Conf Rec 16th Annual Symp on the Foundations of Comptr Sol, Oct 1975, pp 75-84
	20	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]
	21	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]
	22	C. K. Wong , Ashok K. Chandra, Bounds for the String Editing Problem, Journal of the ACM (JACM), v.23 n.1, p.13-16, Jan. 1976 [doi>10.1145/321921.321923]
	23	YAO, C C , AND YAO, F C On computing the rank functxon for a set of vectors UIUCDCS-R-75-699, Dept Comptr Scl , U of illinois at Urbana-Champalgn, Urbana, Ill , Feb 1975.