Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
A Generalization of the Suffix Tree to Square Matrices, with Applications
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Constructing Suffix Trees On-Line in Linear Time
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Towards Automatic Clustering of Protein Sequences
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Efficient parameterized string matching
Information Processing Letters
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
Fast parameterized matching with q-grams
Journal of Discrete Algorithms
On the Longest Common Parameterized Subsequence
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
On the longest common parameterized subsequence
Theoretical Computer Science
Sublinear algorithms for parameterized matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
O(n2 log n) time on-line construction of two-dimensional suffix trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Two dimensional parameterized matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
p-Suffix sorting as arithmetic coding
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
p-Suffix sorting as arithmetic coding
Journal of Discrete Algorithms
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Information Sciences: an International Journal
| Hi-index | 0.00 |