Approximate suffix-prefix dictionary queries
From MaRDI portal
Cites work
- A data structure for dynamic trees
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
- Algorithms on Strings, Trees and Sequences
- All-pairs suffix/prefix in optimal time using Aho-Corasick space
- Almost optimal exact distance oracles for planar graphs
- An efficient algorithm for the all pairs suffix-prefix problem
- An improved algorithm for the all-pairs suffix-prefix problem
- Approximate all-pairs suffix/prefix overlaps
- Approximate distance oracles
- Approximate distance oracles with constant query time
- Approximate distance oracles with improved bounds
- Bootstrapping dynamic distance oracles
- Dictionary matching and indexing with errors and don't cares
- Distance oracles beyond the Thorup-Zwick bound
- Dynamic and internal longest common substring
- Dynamic text and static pattern matching
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- Fast and simple computations using prefix tables under Hamming and edit distance
- Fast parallel and serial approximate string matching
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Iceberg hashing: optimizing many hash-table criteria at once
- Internal dictionary matching
- Internal pattern matching queries in a text and applications
- Internal shortest absent word queries in constant time and linear space
- Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
- Optimal lower and upper bounds for representing sequences
- Suffix-prefix queries on a dictionary
Cited in
(2)
This page was built for publication: Approximate suffix-prefix dictionary queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241095)
