Author:
Bille Philip,Farach-Colton Martin
Subject
General Computer Science,Theoretical Computer Science
Reference32 articles.
1. On economic construction of the transitive closure of a directed graph;Arlazarov;Dokl. Acad. Nauk,1970
2. A new approach to text searching;Baeza-Yates;Commun. ACM,1992
3. Searching subsequences;Baeza-Yates;Theor. Comput. Sci.,1991
4. Fast text searching for regular expressions or automaton searching on tries;Baeza-Yates;J. ACM,1996
5. Faster approximate string matching;Baeza-Yates;Algorithmica,1999
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster space-efficient STR-IC-LCS computation;Theoretical Computer Science;2024-07
2. Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance;SIAM Journal on Computing;2023-11-16
3. Faster Algorithms for Text-to-Pattern Hamming Distances;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Automatic Evaluation of Student Software Solutions in a Virtualized Environment;2023 46th MIPRO ICT and Electronics Convention (MIPRO);2023-05-22
5. Space-Efficient STR-IC-LCS Computation;Lecture Notes in Computer Science;2023