Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Improved dynamic dictionary matching
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Optimal parallel algorithms for string matching
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Pattern matching in dynamic texts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Indexing and Dictionary Matching with One Error
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
Property matching and weighted matching
Theoretical Computer Science
Optimal prefix and suffix queries on texts
Information Processing Letters
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
Efficient computations of l1and l∞rearrangement distances
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
The property suffix tree with dynamic properties
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Simple and efficient LZW-compressed multiple pattern matching
Journal of Discrete Algorithms
| Hi-index | 0.01 |