Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Data structures and network algorithms
Data structures and network algorithms
New data structures for orthogonal range queries
SIAM Journal on Computing
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
An efficient algorithm for the All Pairs Suffix-Prefix Problem
Information Processing Letters
Suffix arrays: a new method for on-line string searches
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
A Generalization of the Suffix Tree to Square Matrices, with Applications
SIAM Journal on Computing
An efficient algorithm for dynamic text indexing
SODA '94 Proceedings of the fifth 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
Incremental Text Editing: A New Data Structure
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
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
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
| Hi-index | 0.00 |