Multidimensional matching and fast search in suffix trees

Richard Cole, Moshe Lewenstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
EditorsJ Schewel
Number of pages2
StatePublished - 2003
EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
Duration: Nov 2 1998Nov 3 1998


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

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics


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

Cite this