Succinct 2D dictionary matching
From MaRDI portal
Publication:2392930
DOI10.1007/S00453-012-9615-9zbMATH Open1270.68099OpenAlexW2148006072MaRDI QIDQ2392930FDOQ2392930
Authors: 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
Recommendations
- Succinct 2D dictionary matching with no slowdown
- Two-dimensional dictionary matching
- Two-dimensional dynamic dictionary matching
- Small-Space 2D Compressed Dictionary Matching
- Succinct Dictionary Matching with No Slowdown
- Fast approximate dictionary matching
- Compressed matching in dictionaries
- An improved query time for succinct dynamic dictionary matching
Pattern recognition, speech recognition (68T10) Searching and sorting (68P10) Nonnumerical algorithms (68W05)
Cites Work
- Efficient string matching
- Compressed indexes for dynamic text collections
- An analysis of the Burrows-Wheeler transform
- Compression of individual sequences via variable-rate coding
- Title not available (Why is that?)
- Fully compressed suffix trees
- A simple storage scheme for strings achieving entropy bounds
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- On-line construction of suffix trees
- Fast Algorithms for Finding Nearest Common Ancestors
- An O(n log n) algorithm for finding all repetitions in a string
- Title not available (Why is that?)
- Two-dimensional dictionary matching
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Inplace 2D matching in compressed images
- Faster entropy-bounded compressed suffix trees
- Succinct Dictionary Matching with No Slowdown
- Wee LCP
- Multiple matching of rectangular patterns
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- Two-dimensional pattern matching in linear time and small space
- Small-Space 2D Compressed Dictionary Matching
- Simple Random Access Compression
- Succinct backward-DAWG-matching
Cited In (13)
- Title not available (Why is that?)
- Full sets of pictures to encode pictures
- Dictionary matching in a stream
- Faster compressed dictionary matching
- A failure function for multiple two-dimensional pattern matching
- Indeterminate string factorizations and degenerate text transformations
- Succinct 2D dictionary matching with no slowdown
- Two-dimensional dictionary matching
- Succinct Dictionary Matching with No Slowdown
- Compressed Multiple Pattern Matching
- 2D Lyndon words and applications
- Small-Space 2D Compressed Dictionary Matching
- An improved query time for succinct dynamic dictionary matching
This page was built for publication: Succinct 2D dictionary matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392930)
