Computing the expected edit distance from a string to a PFA
From MaRDI portal
Recommendations
Cites work
- A theory of the learnable
- Biological Sequence Analysis
- Computing the expected edit distance from a string to a probabilistic finite-state automaton
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Fast approximate search in large dictionaries
- Fast string correction with Levenshtein automata
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 1754502 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1446756 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Learning balls of strings from edit corrections
- Linear-space computation of the edit-distance between a string and a finite automaton
- Median strings for k-nearest neighbour classification
- Order- n correction for regular languages
- The most probable string: an algorithmic study
- Topology of strings: median string is NP-complete
Cited in
(1)
This page was built for publication: Computing the expected edit distance from a string to a PFA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830206)