Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. The longest common subsequence problem revisited;Apostolico;Algorithmica,1987
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. Bounds on the complexity of the longest common subsequence problem;Aho;J. ACM,1976
4. The smallest automaton recognizing the subwords of a text;Blumer;Theoret. Comput. Sci.,1985
5. The subsequence graph of a text;Baeza-Yates,1989
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Existential Definability over the Subword Ordering;Logical Methods in Computer Science;2023-12-21
2. On Problems Related to Absent Subsequences;Combinatorial Optimization and Applications;2023-12-09
3. Absent Subsequences in Words;Fundamenta Informaticae;2023-10-26
4. Longest bordered and periodic subsequences;Information Processing Letters;2023-08
5. Longest Common Subsequence with Gap Constraints;Lecture Notes in Computer Science;2023