Fully-Compressed Suffix Trees

DOI10.1007/978-3-540-78773-0_32zbMath1136.68369OpenAlexW1642710329WikidataQ58884011 ScholiaQ58884011MaRDI QIDQ5458543

Luís M. S. Russo, Arlindo L. Oliveira, Gonzalo Navarro

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_32

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Data structures (68P05)

Related Items (9)

Approximate string matching with compressed indexes ⋮ On compressing and indexing repetitive sequences ⋮ Practical compressed suffix trees ⋮ Combined data structure for previous- and next-smaller-values ⋮ Dynamic extended suffix arrays ⋮ Wee LCP ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Faster entropy-bounded compressed suffix trees ⋮ Space-efficient substring occurrence estimation

This page was built for publication: Fully-Compressed Suffix Trees