Bounds on the Complexity of the Longest Common Subsequence Problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: J. D. Ullman Department of Electrical Engineering, Princeton University, Princeton, NJ
A. V. Aho Bell Laboratories, Inc., 600 Mountain Avenue, Murray Hill, NJ
D. S. Hirschberg Department of Electrical Engineering, Rice University, Houston, TX and Princeton University, Princeton, New Jersey
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 23 Issue 1, Jan. 1976
Pages 1-12
ACM New York, NY, USA
table of contents doi>10.1145/321921.321922
Bounds on the Complexity of the Longest Common Subsequence Problem Published by ACM 1976 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 69
· Downloads (cumulative): 653
· Citation Count: 46


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder