### Abstract

Lingua originale | English |
---|---|

pagine (da-a) | 171-178 |

Numero di pagine | 8 |

Rivista | Theoretical Computer Science |

Volume | 638 |

Stato di pubblicazione | Published - 2016 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cita questo

*Theoretical Computer Science*,

*638*, 171-178.

**Linear-size suffix tries.** / Epifanio, Chiara; Mignosi, Filippo; Grossi, Roberto; Crochemore, Maxime.

Risultato della ricerca: Article

*Theoretical Computer Science*, vol. 638, pagg. 171-178.

}

TY - JOUR

T1 - Linear-size suffix tries

AU - Epifanio, Chiara

AU - Mignosi, Filippo

AU - Grossi, Roberto

AU - Crochemore, Maxime

PY - 2016

Y1 - 2016

N2 - Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n=|w|, a suffix tree for w takes O(n) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ(n2) nodes and links for suffix tries in the worst case because of their unary nodes. It is an interesting question if the suffix trie can be stored using O(n) nodes. We present the linear-size suffix trie, which guarantees O(n) nodes. We use a new technique for reducing the number of unary nodes to O(n), that stems from some results on antidictionaries. For instance, by using the linear-size suffix trie, we are able to check whether a pattern p of length m=|p| occurs in w in O(mlog|Σ|) time and we can find the longest common substring of two strings w1 and w2 in O((|w1|+|w2|)log|Σ|) time for an alphabet Σ.

AB - Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n=|w|, a suffix tree for w takes O(n) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ(n2) nodes and links for suffix tries in the worst case because of their unary nodes. It is an interesting question if the suffix trie can be stored using O(n) nodes. We present the linear-size suffix trie, which guarantees O(n) nodes. We use a new technique for reducing the number of unary nodes to O(n), that stems from some results on antidictionaries. For instance, by using the linear-size suffix trie, we are able to check whether a pattern p of length m=|p| occurs in w in O(mlog|Σ|) time and we can find the longest common substring of two strings w1 and w2 in O((|w1|+|w2|)log|Σ|) time for an alphabet Σ.

UR - http://hdl.handle.net/10447/213681

M3 - Article

VL - 638

SP - 171

EP - 178

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -