Multidimensional matching and fast search in suffix trees

Richard Cole, Moshe Lewenstein

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
JournalProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
StatePublished - 1 Jan 2003


Dive into the research topics of 'Multidimensional matching and fast search in suffix trees'. Together they form a unique fingerprint.

Cite this