Multidimensional matching and fast search in suffix trees

Richard Cole, Moshe Lewenstein

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations


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
Number of pages2
StatePublished - 2003
Externally publishedYes
EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
Duration: 2 Nov 19983 Nov 1998


ConferenceConfiguralble Computing: Technology and Applications
Country/TerritoryUnited States
CityBoston, MA


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

Cite this