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.
| Original language | English |
|---|---|
| Pages | 851-852 |
| Number of pages | 2 |
| State | Published - 2003 |
| Externally published | Yes |
| Event | Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: 2 Nov 1998 → 3 Nov 1998 |
Conference
| Conference | Configuralble Computing: Technology and Applications |
|---|---|
| Country/Territory | United States |
| City | Boston, MA |
| Period | 2/11/98 → 3/11/98 |