String editing under a combination of constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 177058 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Constrained string editing
- Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition
- On the Theory and Computation of Evolutionary Distances
- Recognition of Noisy Subsequences Using Constrained Edit Distances
Cited in
(14)- Longest Lyndon Substring After Edit
- Constrained string editing
- A lower bound for the edit-distance problem under an arbitrary cost function
- scientific article; zbMATH DE number 4053031 (Why is no real title available?)
- The Editor's Corner: Strings, Substrings, and the `Nearest Integer' Function
- scientific article; zbMATH DE number 1482232 (Why is no real title available?)
- scientific article; zbMATH DE number 714495 (Why is no real title available?)
- LMAS: the key to enumerating 2-spheres over the edit metric
- scientific article; zbMATH DE number 3883626 (Why is no real title available?)
- Generation of good edit codes from classical Hamming distance codes
- scientific article; zbMATH DE number 2052917 (Why is no real title available?)
- Constrained many-to-one string editing with memory
- Recognition of Noisy Subsequences Using Constrained Edit Distances
- Bounds and estimates on the average edit distance
This page was built for publication: String editing under a combination of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310955)