GOM Seminar: Claudio Arbib, Wednesday, February 9th 2017 – On the Closest String Problem
Date: February 8th 2017, 11h00 Place: ULB Bruxelles Abstract: The Closest String Problem (CSP) calls for finding an n-string that minimizes its maximum Hamming distance from m given n-strings. This problem, originated in Code Theory, has recently be considered for applications in Bioinformatics. In the last years, integer linear programs…
