Fast matching statistics in small space

DOI10.4230/LIPIcs.SEA.2018.17zbMath1493.68407OpenAlexW2809499789MaRDI QIDQ5140728

Olgert Denas, Fabio Cunial, Djamal Belazzougui

Publication date: 16 December 2020

Full work available at URL: https://doi.org/10.4230/lipics.sea.2018.17

zbMATH Keywords

Burrows-Wheeler transformwavelet treematching statisticsmaximal repeatsuffix tree topology

Mathematics Subject Classification ID

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

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Sequence similarity measures based on bounded Hamming distance
• A simple optimal representation for balanced parentheses
• A framework for space-efficient string kernels
• Compressed suffix trees with full functionality
• Fully Functional Static and Dynamic Succinct Trees
• Locally Compressed Suffix Arrays
• A Compressed Enhanced Suffix Array Supporting Fast String Matching
• Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies