scientific article; zbMATH DE number 2011852
From MaRDI portal
Publication:4437504
Recommendations
Cited in
(25)- A new method for approximate indexing and dictionary lookup with one error
- Two-dimensional substring indexing.
- Approximate string matching with compressed indexes
- String indexing for top-\(k\) close consecutive occurrences
- Practical space-efficient index for structural pattern matching
- Languages with mismatches
- Hashing and indexing: succinct data structures and smoothed analysis
- Approximate string matching using a bidirectional index
- FM-index of alignment: a compressed index for similar strings
- scientific article; zbMATH DE number 2185640 (Why is no real title available?)
- scientific article; zbMATH DE number 2086228 (Why is no real title available?)
- On the Suffix Automaton with Mismatches
- Cache-Oblivious Index for Approximate String Matching
- Simple, compact and robust approximate string dictionary
- scientific article; zbMATH DE number 1982178 (Why is no real title available?)
- Dictionary-symbolwise flexible parsing
- Pattern matching in hypertext
- Approximate String Matching Using a Bidirectional Index
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- A Linear Size Index for Approximate Pattern Matching
- Fast index for approximate string matching
- An approximation algorithm for alphabet indexing problem
- A metric index for approximate string matching
- From Nerode's congruence to suffix automata with mismatches
- Text indexing with errors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437504)
