Engineering a compressed suffix tree implementation

DOI10.1145/1498698.1594228zbMath1284.68710OpenAlexW2146346985MaRDI QIDQ5406217

No author found.

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1498698.1594228

zbMATH Keywords

Burrows-Wheeler transformtext compressiontext indexingalgorithm engineeringwavelet treelowest common ancestorbiological sequence analysisbalanced parenthesesLCP values

Mathematics Subject Classification ID

Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)

Related Items (7)

Extended suffix array construction using Lyndon factors ⋮ Lempel Ziv Computation in Small Space (LZ-CISS) ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Space-efficient construction of compressed suffix trees ⋮ Practical compressed suffix trees ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies

This page was built for publication: Engineering a compressed suffix tree implementation