Multi-Dimensional Substring Selectivity Estimation
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Index for Two Dimensional String Matching Allowing Rotations
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
One-dimensional and multi-dimensional substring selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Two-dimensional pattern matching with rotations
Theoretical Computer Science
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Theoretical Computer Science
Two-dimensional pattern matching with rotations
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A note on a tree-based 2D indexing
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
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
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.01 |