A New Algorithm for Sparse Suffix Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A New Algorithm for Sparse Suffix Trees

Abstract

The sparse suffix trees are suffix trees in which some suffixes are omitted. There are many applications for these structures, ranging from bioinformatics to natural language processing. In many cases, they can replace the complete suffix tree, without decreasing the performance, but with expressive gains in memory consumption. Here, we present a new optimal algorithm to build the sparse suffix tree. That algorithm is simple enough to be implemented and to obtain good results in practice.
No file

Dates and versions

hal-00748786 , version 1 (06-11-2012)

Identifiers

  • HAL Id : hal-00748786 , version 1

Cite

Gustavo Akio Tominaga Sacomoto, Alair Pereira Do Lago. A New Algorithm for Sparse Suffix Trees. Brazilian Symposium on Bioinformatics, 2011, Brasília, Brazil. ⟨hal-00748786⟩
71 View
0 Download

Share

Gmail Facebook X LinkedIn More