Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. Bounds on the complexity of the longest common subsequence problem;Aho;Journal of the ACM,1976
2. An all-substrings common subsequence algorithm;Alves;Electronic Notes in Discrete Mathematics,2005
3. String editing and longest common subsequences;Apostolico,1997
4. On economical construction of the transitive closure of an oriented graph;Arlazarov;Soviet Mathematical Doklady,1970
5. Multidimensional divide-and-conquer;Bentley;Communications of the ACM,1980
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
3. Communication vs Synchronisation in Parallel String Comparison;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
4. Reduction of the uncertainty in feature tracking;Applied Intelligence;2018-07-13
5. On Almost Monge All Scores Matrices;Algorithmica;2018-03-27