Charge and reduce: A fixed-parameter algorithm for string-to-string correction
From MaRDI portal
(Redirected from Publication:456695)
Recommendations
Cites work
- scientific article; zbMATH DE number 3557227 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- An Extension of the String-to-String Correction Problem
- An efficient exact algorithm for constraint bipartite vertex cover
- Error detecting and error correcting codes
- Searching Trees: An Essay
- The Complexity of Some Problems on Subsequences and Supersequences
Cited in
(5)- An improved algorithm for solving the banded cyclic string-to-string correction problem
- On the parameterised complexity of string morphism problems
- scientific article; zbMATH DE number 139810 (Why is no real title available?)
- Maximum common induced subgraph parameterized by vertex cover
- Using swaps and deletes to make strings match
This page was built for publication: Charge and reduce: A fixed-parameter algorithm for string-to-string correction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456695)