A branch-and-cut approach to the repetition-free longest common subsequence problem

DOI10.1016/j.endm.2010.05.067zbMath1237.90167OpenAlexW2020089709MaRDI QIDQ2883608

Christian Tjandraatmadja, Carlos E. Ferreira

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.067

zbMATH Keywords

integer programmingbranch-and-cutlongest common subsequence

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

Repetition-free longest common subsequence of random sequences ⋮ The constrained shortest common supersequence problem ⋮ Comparing incomplete sequences via longest common subsequence

Cites Work

• A fast algorithm for computing longest common subsequences
• The String-to-String Correction Problem
• A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
• Repetition-free longest common subsequence

This page was built for publication: A branch-and-cut approach to the repetition-free longest common subsequence problem