An integer linear programming approach for approximate string comparison

DOI10.1016/J.EJOR.2008.10.013MaRDI QIDQ1042045zbMATH OpenOpenAlexFDO

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

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 programmingdistance metrichop constraintsapproximate string matchingblock editsblock moves

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• An improved integer linear programming formulation for the closest 0-1 string problem
• scientific article; zbMATH DE number 3845091
• Algorithms for approximate string matching
• An approximate string-matching algorithm
• Publication:4733401
• An Improved Algorithm For Approximate String Matching
• A randomized algorithm for approximate string matching
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

Cites work

• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• Block edit models for approximate string matching
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

Cited in

(1)

• scientific article; zbMATH DE number 4128413 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042045)