### Abstract

We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for 2D arrays. These trees also have the property that the node degrees may be large. We add a new back-propagation component to McCreight's algorithm and also give a high probability perfect hashing scheme to cope with large degrees. We show that these two features enable construction of suffix trees for general situations with missing suffix links in O(n) time, with high probability. This gives the first randomized Linear time algorithm for constructing suffix trees for parameterized strings.

Original language | English (US) |
---|---|

Title of host publication | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |

Pages | 407-415 |

Number of pages | 9 |

State | Published - 2000 |

Event | 32nd Annual ACM Symposium on Theory of Computing - Portland, OR, USA Duration: May 21 2000 → May 23 2000 |

### Other

Other | 32nd Annual ACM Symposium on Theory of Computing |
---|---|

City | Portland, OR, USA |

Period | 5/21/00 → 5/23/00 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*(pp. 407-415)

**Faster suffix tree construction with missing suffix links.** / Cole, Richard; Hariharan, Ramesh.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing.*pp. 407-415, 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 5/21/00.

}

TY - GEN

T1 - Faster suffix tree construction with missing suffix links

AU - Cole, Richard

AU - Hariharan, Ramesh

PY - 2000

Y1 - 2000

N2 - We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for 2D arrays. These trees also have the property that the node degrees may be large. We add a new back-propagation component to McCreight's algorithm and also give a high probability perfect hashing scheme to cope with large degrees. We show that these two features enable construction of suffix trees for general situations with missing suffix links in O(n) time, with high probability. This gives the first randomized Linear time algorithm for constructing suffix trees for parameterized strings.

AB - We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for 2D arrays. These trees also have the property that the node degrees may be large. We add a new back-propagation component to McCreight's algorithm and also give a high probability perfect hashing scheme to cope with large degrees. We show that these two features enable construction of suffix trees for general situations with missing suffix links in O(n) time, with high probability. This gives the first randomized Linear time algorithm for constructing suffix trees for parameterized strings.

UR - http://www.scopus.com/inward/record.url?scp=0033690736&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033690736&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033690736

SP - 407

EP - 415

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ER -