Engineering a compressed suffix tree implementation
From MaRDI portal
Publication:5406217
DOI10.1145/1498698.1594228zbMath1284.68710MaRDI 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
Burrows-Wheeler transform; text compression; text indexing; algorithm engineering; wavelet tree; lowest common ancestor; biological sequence analysis; balanced parentheses; LCP values
68R15: Combinatorics on words
92D20: Protein sequences, DNA sequences
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68P05: Data structures
68W32: Algorithms on strings
Related Items
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies, Ultra-succinct representation of ordered trees with applications, Lempel-Ziv factorization powered by space efficient suffix trees, Extended suffix array construction using Lyndon factors, Practical compressed suffix trees, Space-efficient construction of compressed suffix trees, Lempel Ziv Computation in Small Space (LZ-CISS)