Configurations and minority in the string consensus problem
From MaRDI portal
Publication:289911
DOI10.1007/S00453-015-9996-7zbMATH Open1344.68305OpenAlexW2018731567MaRDI QIDQ289911FDOQ289911
Authors: Amihood Amir, Haim Paryenty, Liam Roditty 
Publication date: 31 May 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-9996-7
Recommendations
Cites Work
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Distinguishing string selection problems.
- Optimal solutions for the closest-string problem via integer programming
- Integer Programming with a Fixed Number of Variables
- On the closest string and substring problems
- More efficient algorithms for closest string and substring problems
- A linear-time algorithm for the 1-mismatch problem
- On covering problems of codes
- Configurations and minority in the string consensus problem
- Title not available (Why is that?)
- A closer look at the closest string and closest substring problem
Cited In (5)
- Configurations and minority in the string consensus problem
- Configurations and minority in the string consensus problem
- On the string consensus problem and the Manhattan sequence consensus problem
- On the string consensus problem and the Manhattan sequence consensus problem
- Two-string consensus problem under non-overlapping inversion and transposition distance
This page was built for publication: Configurations and minority in the string consensus problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289911)
