Charge and reduce: A fixed-parameter algorithm for string-to-string correction
From MaRDI portal
Publication:456695
DOI10.1016/J.DISOPT.2010.10.003zbMATH Open1248.90065OpenAlexW2077167828MaRDI QIDQ456695FDOQ456695
Authors: Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege
Publication date: 16 October 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.10.003
Recommendations
Cites Work
- Title not available (Why is that?)
- Error detecting and error correcting codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Extension of the String-to-String Correction Problem
- The Complexity of Some Problems on Subsequences and Supersequences
- Searching Trees: An Essay
- An efficient exact algorithm for constraint bipartite vertex cover
- Title not available (Why is that?)
Cited In (6)
- Adaptive computation of the swap-insert correction distance
- Title not available (Why is that?)
- On the parameterised complexity of string morphism problems
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- 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)