Author:
Apostolico Alberto,Atallah Mikhail J.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference12 articles.
1. Pattern Matching Algorithms;Apostolico,1997
2. The longest common subsequence problem revisited;Apostolico;Algorithmica,1987
3. Searching subsequences;Baeza-Yates;Theoret. Comput. Sci.,1991
4. The smallest automaton recognizing the subwords of a text;Blumer;Theoret. Comput. Sci.,1985
5. Cobbs, A.1995, Fast approximate matchings using suffix trees, in CPM'95, Proceedings of the 6th Annual Symposium on Combinatorial Pattern MatchingZ. Galil and E. Ukkonen, Eds., Lecture Notes in Computer Science, Vol. 937, pp. 41–54, Springer-Verlag, Berlin/New York.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献