What is it about?
01 strings encode many things, life for example. Here we try to make the best use of a powerful tool - integer linear programming - to find a 01 string that is "central" with respect to a given (perhaps big) set of 01 strings.
Featured Image
Why is it important?
Because our idea can in practice accelerate the search up to a factor of 3,000.
Perspectives
We believe that this paper makes a step in the right direction for problems with binary strings. Our approach, however, would not work for non-binary ones, such as DNA. In our opinion it would be interesting to further investigate this extension.
Claudio Arbib
Read the Original
This page is a summary of: An improved integer linear programming formulation for the closest 0-1 string problem, Computers & Operations Research, April 2017, Elsevier,
DOI: 10.1016/j.cor.2016.11.019.
You can read the full text:
Contributors
The following have contributed to this page
