Configurations and minority in the string consensus problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2081011 (Why is no real title available?)
- A closer look at the closest string and closest substring problem
- A linear-time algorithm for the 1-mismatch problem
- Configurations and minority in the string consensus problem
- Distinguishing string selection problems.
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Integer Programming with a Fixed Number of Variables
- More efficient algorithms for closest string and substring problems
- On covering problems of codes
- On the closest string and substring problems
- Optimal solutions for the closest-string problem via integer programming
Cited in
(5)- Two-string consensus problem under non-overlapping inversion and transposition distance
- Configurations and minority in the string consensus problem
- On the string consensus problem and the Manhattan sequence consensus problem
- Configurations and minority in the string consensus problem
- On the string consensus problem and the Manhattan sequence consensus problem
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)