Document Open Access Logo

Integer Programming Models for the Median of a 0-1 String Set Under Levenshtein Distance

Authors Claudio Arbib , Andrea D'Ascenzo , Oya E. Karaşan , Andrea Pizzuti

PDF

File

Thumbnail PDF
PDF
LIPIcs.SEA.2026.4.pdf
  • Filesize: 1.18 MB
  • 15 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorial optimization
  • Theory of computation → Integer programming
Keywords
  • Levenshtein Distance
  • Median String Problem
  • Integer Programming

Metrics

Abstract

The Median String Problem calls for finding a string that minimizes the average distance from a given set of strings. Under the Levenshtein (or edit) metric, the problem is NP-hard even for binary strings. We devised two novel integer linear programming models for this case and tested them against the only formulation we are aware of in the literature. Our numerical experiments attest to the efficacy of the proposed approach.

Cite As Get BibTex

Claudio Arbib, Andrea D'Ascenzo, Oya E. Karaşan, and Andrea Pizzuti. Integer Programming Models for the Median of a 0-1 String Set Under Levenshtein Distance. In 24th International Symposium on Experimental Algorithms (SEA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 371, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SEA.2026.4

Author Details

Claudio Arbib
  • Dipartimento di Ingegneria/Scienze dell'Informazione e Matematica, Università degli Studi dell'Aquila, Italy
  • Centre of Excellence DEWS, Coppito, Italy
Andrea D'Ascenzo
  • Department of Computer Science, Gran Sasso Science Institute, L'Aquila, Italy
Oya E. Karaşan
  • Department of Industrial Engineering, Bilkent University, Ankara, Turkey
Andrea Pizzuti
  • Dipartimento di Scienze Teoriche e Applicate, Università degli Studi eCampus, Novedrate, Italy

Funding

  • Arbib, Claudio: National Innovation Ecosystem grant ECS00000041–VITALITY–CUP E13C22001060006. VITALITY: Innovation, digitalization and sustainability for the diffused economy in Central Italy (Ecosistema di Innovazione, Digitalizzazione e Sostenibilità per l’Economia Diffusa nell’Italia Centrale).
  • D'Ascenzo, Andrea: Partially supported by the MUR (Italy) Department of Excellence 2023–2027.

Acknowledgements

The authors are grateful to the reviewers for their helpful comments.

Supplementary Materials

References

  1. José I Abreu Salas and Juan R Rico-Juan. A new iterative algorithm for computing a quality approximate median of strings based on edit operations. Pattern Recognition Letters, 36:74-80, 2014. URL: https://doi.org/10.1016/j.patrec.2013.09.014.
  2. Claudio Arbib, Andrea D'Ascenzo, Oya E. Karaşan, and Andrea Pizzuti. D-hash/CenterLevenshtein. Software, (visited on 2026-06-01). URL: https://github.com/D-hash/CenterLevenshtein
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.26233
  3. Claudio Arbib, Giovanni Felici, Mara Servilio, and Paolo Ventura. Optimum solution of the closest string problem via rank distance. In Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers 4, pages 297-307. Springer, 2016. URL: https://doi.org/10.1007/978-3-319-45587-7_26.
  4. Claudio Arbib, Mara Servilio, and Paolo Ventura. An improved integer linear programming formulation for the closest 0-1 string problem. Computers & Operations Research, 80:94-100, 2017. URL: https://doi.org/10.1016/J.COR.2016.11.019.
  5. Arturs Backurs and Piotr Indyk. Edit distance cannot be computed in strongly subquadratic time (unless seth is false). In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 51-58, 2015. URL: https://doi.org/10.1145/2746539.2746612.
  6. Bonnie Berger, Michael S Waterman, and Yun William Yu. Levenshtein distance, sequence comparison and biological database search. IEEE transactions on information theory, 67(6):3287-3294, 2020. URL: https://doi.org/10.1109/TIT.2020.2996543.
  7. Christina Boucher and Mohamed Omar. On the hardness of counting and sampling center strings. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(6):1843-1846, 2012. URL: https://doi.org/10.1109/TCBB.2012.84.
  8. Horst Bunke, Xiaoyi Jiang, Karin Abegglen, and Abraham Kandel. On the weighted mean of a pair of strings. Pattern Analysis & Applications, 5:23-30, 2002. URL: https://doi.org/10.1007/S100440200003.
  9. Ramón A Mollinedas Cardenas. A learning model for multiple-prototype classification of strings. In Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004., volume 4, pages 420-423 Vol.4, 2004. URL: https://doi.org/10.1109/ICPR.2004.1333792.
  10. Diptarka Chakraborty, Debarati Das, and Robert Krauthgamer. Approximate Trace Reconstruction via Median String (In Average-Case). In Mikołaj Bojańczy and Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), volume 213 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1-11:23, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2021.11.
  11. Sei-Wang Chen, ST Tung, Chiung-Yao Fang, Shen Cherng, and Anil K Jain. Extended attributed string matching for shape recognition. Computer Vision and Image Understanding, 70(1):36-50, 1998. URL: https://doi.org/10.1006/CVIU.1998.0599.
  12. Debarati Das and Barna Saha. Approximating LCS and Alignment Distance over Multiple Sequences. In Amit Chakrabarti and Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022), volume 245 of Leibniz International Proceedings in Informatics (LIPIcs), pages 54:1-54:21, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.54.
  13. Federico Della Croce and Michele Garraffa. The selective fixing algorithm for the closest string problem. Computers & operations research, 41:24-30, 2014. URL: https://doi.org/10.1016/J.COR.2013.07.017.
  14. Liviu P Dinu and Radu Tudor Ionescu. Clustering based on median and closest string via rank distance with applications on dna. Neural Computing and Applications, 24:77-84, 2014. URL: https://doi.org/10.1007/S00521-013-1468-X.
  15. Moti Frances and Ami Litman. On covering problems of codes. Theory of Computing Systems, 30:113-119, 1997. URL: https://doi.org/10.1007/S002240000044.
  16. Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, and Barna Saha. How compression and approximation affect efficiency in string distance measures. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2867-2919. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.112.
  17. Leszek Ga̧sieniec, Jesper Jansson, and Andrzej Lingas. Efficient approximation algorithms for the hamming center problem. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pages 905-906, 1999. Google Scholar
  18. Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2023. URL: https://www.gurobi.com.
  19. Richard W Hamming. Error detecting and error correcting codes. The Bell system technical journal, 29(2):147-160, 1950. Google Scholar
  20. Morihiro Hayashida and Hitoshi Koyano. Finding median and center strings for a probability distribution on a set of strings under levenshtein distance based on integer linear programming. In Biomedical Engineering Systems and Technologies: 9th International Joint Conference, BIOSTEC 2016, Rome, Italy, February 21-23, 2016, Revised Selected Papers 9, pages 108-121. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-54717-6_7.
  21. Gary Hoppenworth, Jason W Bentley, Daniel Gibney, and Sharma V Thankachan. The fine-grained complexity of median and center string problems under edit distance. In 28th Annual European Symposium on Algorithms, ESA 2020, 2020. Google Scholar
  22. Tao Jiang, Ying Xu, and Michael Q. Zhang. Bio-Sequence Comparison and Applications, pages 45-69. MIT Press, 2002. Google Scholar
  23. Marcos Kiwi and Martin Loebl. Largest planar matching in random bipartite graphs. Random Structures & Algorithms, 21(2):162-181, 2002. URL: https://doi.org/10.1002/rsa.10048.
  24. Tomohiro Koana, Vincent Froese, and Rolf Niedermeier. The complexity of binary matrix completion under diameter constraints. Journal of Computer and System Sciences, 132:45-67, 2023. URL: https://doi.org/10.1016/J.JCSS.2022.10.001.
  25. Federico Malucelli, Thomas Ottmann, and Daniele Pretolani. Efficient labelling algorithms for the maximum noncrossing matching problem. Discrete Applied Mathematics, 47(2):175-179, 1993. URL: https://doi.org/10.1016/0166-218X(93)90090-B.
  26. Carlos D Martínez-Hinarejos, Alfons Juan, and Francisco Casacuberta. Use of median string for classification. In Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, volume 2, pages 903-906. IEEE, 2000. Google Scholar
  27. Carlos D Martínez-Hinarejos, Alfons Juan-Císcar, and Francisco Casacuberta. Median strings for k-nearest neighbour classification. Pattern Recognition Letters, 24(1):173-181, 2003. URL: https://doi.org/10.1016/S0167-8655(02)00209-X.
  28. Cláudio N Meneses, Zhaosong Lu, Carlos AS Oliveira, and Panos M Pardalos. Optimal solutions for the closest-string problem via integer programming. INFORMS Journal on Computing, 16(4):419-429, 2004. URL: https://doi.org/10.1287/IJOC.1040.0090.
  29. Pedro Mirabal, José I Abreu Salas, and Diego Seco. Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string. Pattern Recognition Letters, 120:104-111, 2019. URL: https://doi.org/10.1016/j.patrec.2019.02.004.
  30. David E Muller. Application of boolean algebra to switching circuit design and to error detection. Trans. I R E Prof. Group Electron. Comput., 3(3):6-12, 1954. URL: https://doi.org/10.1109/IREPGELC.1954.6499441.
  31. François Nicolas and Eric Rivals. Hardness results for the center and median string problems under the weighted and unweighted edit distances. Journal of discrete algorithms, 3(2-4):390-415, 2005. URL: https://doi.org/10.1016/J.JDA.2004.08.015.
  32. Irving S Reed. A class of multiple-error-correcting codes and the decoding scheme. Trans. IRE Prof. Group Inf. Theory, 4:38-49, 1954. URL: https://doi.org/10.1109/TIT.1954.1057465.
  33. Robert A Wagner and Michael J Fischer. The string-to-string correction problem. Journal of the ACM (JACM), 21(1):168-173, 1974. URL: https://doi.org/10.1145/321796.321811.
  34. Shirley Xu and David Perkins. A heuristic solution to the closest string problem using wave function collapse techniques. IEEE Access, 10:115869-115883, 2022. URL: https://doi.org/10.1109/ACCESS.2022.3218003.
  35. Shota Yuasa, Zhi-Zhong Chen, Bin Ma, and Lusheng Wang. Designing and implementing algorithms for the closest string problem. Theoretical Computer Science, 786:32-43, 2019. URL: https://doi.org/10.1016/J.TCS.2018.05.017.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact