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.
Type de document :
Communication dans un congrès
Brazilian Symposium on Bioinformatics, 2011, Brasília, Brazil. 2011, 〈http://dl.acm.org/citation.cfm?id=2032977〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00748786
Contributeur : Marie-France Sagot <>
Soumis le : mardi 6 novembre 2012 - 08:24:30
Dernière modification le : jeudi 19 avril 2018 - 14:49:47

Identifiants

  • HAL Id : hal-00748786, version 1

Collections

Citation

Gustavo Akio Tominaga Sacomoto, Alair Pereira Do Lago. A New Algorithm for Sparse Suffix Trees. Brazilian Symposium on Bioinformatics, 2011, Brasília, Brazil. 2011, 〈http://dl.acm.org/citation.cfm?id=2032977〉. 〈hal-00748786〉

Partager

Métriques

Consultations de la notice

112