Fully-Compressed Suffix Trees
From MaRDI portal
Publication:5458543
DOI10.1007/978-3-540-78773-0_32zbMATH Open1136.68369OpenAlexW1642710329WikidataQ58884011 ScholiaQ58884011MaRDI QIDQ5458543FDOQ5458543
Authors: 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
Recommendations
Cited In (25)
- Representing the suffix tree with the CDAWG
- Space-efficient substring occurrence estimation
- Block trees
- Practical compressed suffix trees
- Faster entropy-bounded compressed suffix trees
- Compressed suffix trees, efficient computation and storage of LCP-values
- Engineering a compressed suffix tree implementation
- Efficient fully-compressed sequence representations
- An(other) Entropy-Bounded Compressed Suffix Tree
- Dynamic extended suffix arrays
- Lempel-Ziv factorization powered by space efficient suffix trees
- Lossless Compression of Binary Trees With Correlated Vertex Names
- On compressing and indexing repetitive sequences
- Wee LCP
- REACHABILITY ON SUFFIX TREE GRAPHS
- Approximate string matching with compressed indexes
- Compressed suffix trees with full functionality
- Compressed Cache-Oblivious String B-tree
- Weighted ancestors in suffix trees
- Dynamic Fully-Compressed Suffix Trees
- Combined data structure for previous- and next-smaller-values
- Fully compressed suffix trees
- Title not available (Why is that?)
- Truncated suffix trees and their application to data compression.
- Faster compressed suffix trees for repetitive collections
This page was built for publication: Fully-Compressed Suffix Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458543)
