Succinct 2D dictionary matching
From MaRDI portal
Publication:2392930
DOI10.1007/s00453-012-9615-9zbMath1270.68099OpenAlexW2148006072MaRDI QIDQ2392930
Shoshana Neuburger, Dina Sokol
Publication date: 5 August 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9615-9
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)
Related Items (5)
Indeterminate string factorizations and degenerate text transformations ⋮ Full sets of pictures to encode pictures ⋮ 2D Lyndon words and applications ⋮ Unnamed Item ⋮ Compressed Multiple Pattern Matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple storage scheme for strings achieving entropy bounds
- Wee LCP
- Faster entropy-bounded compressed suffix trees
- Two-dimensional dictionary matching
- Multiple matching of rectangular patterns
- On-line construction of suffix trees
- Compressed indexes for dynamic text collections
- Fully compressed suffix trees
- An analysis of the Burrows—Wheeler transform
- Fast Algorithms for Finding Nearest Common Ancestors
- An O(n log n) algorithm for finding all repetitions in a string
- Small-Space 2D Compressed Dictionary Matching
- Succinct Dictionary Matching with No Slowdown
- Simple Random Access Compression
- Efficient string matching
- Fast Pattern Matching in Strings
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Compression of individual sequences via variable-rate coding
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- Inplace 2D matching in compressed images
- Two-dimensional pattern matching in linear time and small space
- Succinct backward-DAWG-matching
This page was built for publication: Succinct 2D dictionary matching
