Author:
Landau Gad M.,Vishkin Uzi
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. A fast string searching algorithm;Boyer;Comm. ACM,1977
3. Efficient and elegant subword tree construction;Chen,1985
4. Optimal parallel algorithms for string matching;Galil,1984
5. Optimal parallel algorithms for string matching
Cited by
120 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Communication Complexity of Approximate Pattern Matching;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. On Two-Dimensional Approximate Pattern Matching Using Fuzzy Automata;Lecture Notes in Networks and Systems;2024
3. Comparison of algorithms for estimating the distance between words for finding similar sentences;Reporter of the Priazovskyi State Technical University. Section: Technical sciences;2023-12-28
4. Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance;SIAM Journal on Computing;2023-11-16
5. Optimal Algorithms for Bounded Weighted Edit Distance;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06