Optimum Solution of the Closest String Problem via Rank Distance

DOI10.1007/978-3-319-45587-7_26zbMATH Open1445.68363OpenAlexW2513478613MaRDI QIDQ2835685FDOQ2835685

Authors: Claudio Arbib, Giovanni Felici, Mara Servilio, P. Ventura 

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_26

Recommendations

• Algorithms for closest and farthest string problems via rank distance
• On the closest string via rank distance
• Optimal solutions for the closest-string problem via integer programming
• Improved optimization modelling for the closest string and related problems
• scientific article; zbMATH DE number 2081011
• Randomized and Parameterized Algorithms for the Closest String Problem
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Randomized fixed-parameter algorithms for the closest string problem
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• The selective fixing algorithm for the closest string problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Genetics and epigenetics (92D10) Integer programming (90C10) Algorithms on strings (68W32)

Cites Work

• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• The selective fixing algorithm for the closest string problem
• On the closest string via rank distance
• An improved integer linear programming formulation for the closest 0-1 string problem
• Scheduling two chains of unit jobs on one machine: a polyhedral study

Cited In (7)

• Title not available (Why is that?)
• On the closest string via rank distance
• A closer look at the closest string and closest substring problem
• Optimal solutions for the closest-string problem via integer programming
• An improved integer linear programming formulation for the closest 0-1 string problem
• Improved optimization modelling for the closest string and related problems
• Efficient solutions for the far from most string problem

This page was built for publication: Optimum Solution of the Closest String Problem via Rank Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835685)