Algorithms for the Longest Common Subsequence Problem-Reference-Cited by-同舟云学术

Algorithms for the Longest Common Subsequence Problem

Published:1977-10 Issue:4 Volume:24 Page:664-675
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Hirschberg Daniel S.¹

Affiliation:

1. Department of Electrical Engineering, Rice University, Houston, TX and Princeton University, Princeton, New Jersey

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference23 articles.

1. AHO A V HOPCROF'r J E AND ULLMAN J D The Destgn and Analysts of Computer Algortthms Addison-Wesley Reading Mass 1974 AHO A V HOPCROF'r J E AND ULLMAN J D The Destgn and Analysts of Computer Algortthms Addison-Wesley Reading Mass 1974

2. Ario A V HmSCHBV.R6 D.S AND ULLUAN J D Bounds on the complexity of the longest common subsequence problem J ACM 23 1 (Jan 1976) 1-12. 10.1145/321921.321922 Ario A V HmSCHBV.R6 D.S AND ULLUAN J D Bounds on the complexity of the longest common subsequence problem J ACM 23 1 (Jan 1976) 1-12. 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 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

Cited by 430 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial-time equivalences and refined algorithms for longest common subsequence variants;Discrete Applied Mathematics;2024-08

2. X-Lifecycle Learning for Cloud Incident Management using LLMs;Companion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering;2024-07-10

3. Automated Root Causing of Cloud Incidents using In-Context Learning with GPT-4;Companion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering;2024-07-10

4. Parallel and (Nearly) Work-Efficient Dynamic Programming;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

5. Dynamic-MLCS: Fast searching for dynamic multiple longest common subsequences in sequence stream data;Knowledge-Based Systems;2024-06