An integer linear programming approach for approximate string comparison

DOI10.1016/J.EJOR.2008.10.013zbMath1176.90420OpenAlexW1998465760MaRDI QIDQ1042045

Marcus Ritt, Viviane M. Orengo, Alysson M. Costa, Sergio Mergen

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.10.013

zbMATH Keywords

integer programmingapproximate string matchingdistance metrichop constraintsblock editsblock moves

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Block edit models for approximate string matching
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

This page was built for publication: An integer linear programming approach for approximate string comparison