A guided tour to approximate string matching
The source holds an abstract for this work, but its best open-access copy is under other-oa, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- A guided tour to approximate string matching→Introduction to AlgorithmsLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Modern Information RetrievalLegacy edge — source detail unavailable
- A guided tour to approximate string matching→The Art of Computer Programming: Volume 3: Sorting and SearchingLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Algorithms on strings, trees, and sequences computer science and computational biologyLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Algorithms on Strings, Trees and SequencesLegacy edge — source detail unavailable
- A guided tour to approximate string matching→The String-to-String Correction ProblemLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Efficient string matchingLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Fast Pattern Matching in StringsLegacy edge — source detail unavailable
- A guided tour to approximate string matching→A fast string searching algorithmLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Compari…Legacy edge — source detail unavailable
- A guided tour to approximate string matching→Linear pattern matching algorithmsLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Algorithms on strings, trees, and sequencesLegacy edge — source detail unavailable
- A guided tour to approximate string matching→A technique for computer detection and correction of spelling errorsLegacy edge — source detail unavailable
- A guided tour to approximate string matching→A Space-Economical Suffix Tree Construction AlgorithmLegacy edge — source detail unavailable
- A guided tour to approximate string matching→On-line construction of suffix treesLegacy edge — source detail unavailable
- Fast Pattern Matching in Strings→Efficient string matchingLegacy edge — source detail unavailable
- On-line construction of suffix trees→Efficient string matchingLegacy edge — source detail unavailable
- On-line construction of suffix trees→A Space-Economical Suffix Tree Construction AlgorithmLegacy edge — source detail unavailable
- On-line construction of suffix trees→Linear pattern matching algorithmsLegacy edge — source detail unavailable
- A Space-Economical Suffix Tree Construction Algorithm→Fast Pattern Matching in StringsLegacy edge — source detail unavailable
- A Space-Economical Suffix Tree Construction Algorithm→Linear pattern matching algorithmsLegacy edge — source detail unavailable
- A fast string searching algorithm→Fast Pattern Matching in StringsLegacy edge — source detail unavailable
- A fast string searching algorithm→Efficient string matchingLegacy edge — source detail unavailable
What this paper cites, inside the corpus
Links
Download BibTeX · Download RIS · DOI · Open access copy · OpenAlex record
Topics
| Algorithms and Data Compression | Computer Science |
| Network Packet Processing and Optimization | Computer Science |
| DNA and Biological Computing | Biochemistry, Genetics and Molecular Biology |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports1 author record(s) attached.
- supports162 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 a2172c1bbe00c44b…