Abstract
The Closest String Problem (CSP) calls for finding an n-string that minimizes its maximum distance from m given n-strings. Integer linear programming (ILP) proved to be able to solve large CSPs under the Hamming distance, whereas for the Levenshtein distance, preferred in computational biology, no ILP formulation has so far be investigated. Recent research has however demonstrated that another metric, rank distance, can provide interesting results with genomic sequences. Moreover, CSP under rank distance can easily be modeled via ILP: optimal solutions can then be certified, or information on approximation obtained via dual gap. In this work we test this ILP formulation on random and biological data. Our experiments, conducted on strings with up to 600 nucleotides, show that the approach outperforms literature heuristics. We also enforce the formulation by cover inequalities. Interestingly, due to the special structure of the rank distance between two strings, cover separation can be done in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Arbib, C., Labbé, M., Servilio, M.: Scheduling two chains of unit jobs on one machine: a polyhedral study. Networks 58(2), 103–113 (2011)
Arbib, C., Servilio, M., Ventura, P.: Improved integer linear programming formulations for the 0–1 closest string problem (2015, submitted)
Balas, E.: Facets of the knapsack polytope. Math. Program. 8, 146–164 (1975)
Chimani, M., Woste, M., Bocker, S.: A closer look at the closest string and closest substring problem. In: Proceedings of the 13th Workshop on Algorithm Engineering and Experiments – ALENE, pp. 13–24 (2011)
Della Croce, F., Giarraffa, M.: The selective fixing algorithm for the closest string problem. Comput. Oper. Res. 41, 24–30 (2014)
Dinu, L.P., Ionescu, R.: An efficient rank based approach for closest string and closest substring. PLoS ONE 7(6), e37576 (2012). doi:10.1371/journal.pone.0037576
Dinu, L.P., Popa, A.: On the closest string via rank distance. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 413–426. Springer, Heidelberg (2012)
Hammer, P.L., Johnson, E.L., Peled, U.N.: Facets of regular 0-1 polytopes. Math. Program. 8, 179–206 (1975)
Kaparis, K., Letchford, A.N.: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 186, 91–103 (2008)
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals (in Russian). Doklady Akademii Nauk SSSR 163(4), 845–848 (1965). English translation in Soviet Physics Doklady 10(8), 707–710 (1966)
Roy, T.J., Wolsey, L.A.: Solving mixed integer programming problems using automatic reformulation. Oper. Res. 35, 45–57 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Arbib, C., Felici, G., Servilio, M., Ventura, P. (2016). Optimum Solution of the Closest String Problem via Rank Distance. In: Cerulli, R., Fujishige, S., Mahjoub, A. (eds) Combinatorial Optimization. ISCO 2016. Lecture Notes in Computer Science(), vol 9849. Springer, Cham. https://doi.org/10.1007/978-3-319-45587-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-45587-7_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45586-0
Online ISBN: 978-3-319-45587-7
eBook Packages: Computer ScienceComputer Science (R0)