Multidimensional matching and fast search in suffix trees

Authors:
Richard Cole;Moshe Lewenstein
Affiliations:
NYU;Bar Ilan University
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 11
Cited 0

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
An Alphabet Independent Approach to Two-Dimensional Pattern Matching

SIAM Journal on Computing
Dictionary-matching on unbounded alphabets: uniform length dictionaries

Journal of Algorithms
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)
Algorithm 360: shortest-path forest with topological ordering [H]

Communications of the ACM
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Truly alphabet-independent two-dimensional pattern matching

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to construct a suffix tree of a text string t in linear time, after sorting the characters in the text, so that a search for pattern p take time O(p + log t), independent of the alphabet size, thereby matching the asymptotic performance of suffix arrays. Using these suffix trees or suffix arrays we then give linear time algorithms for pattern matching in any fixed dimension.