A branch-and-cut approach to the repetition-free longest common subsequence problem
type: Item
instance of: scholarly article
title: A branch-and-cut approach to the repetition-free longest common subsequence problem
zbMATH Open document ID: 1237.90167
author: Christian Tjandraatmadja
author: Carlos E. Ferreira
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6033965
zbMATH Keywords: longest common subsequence
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-cut
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.067
OpenAlex ID: W2020089709
cites work: Repetition-free longest common subsequence
cites work: A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
cites work: A fast algorithm for computing longest common subsequences
cites work: The String-to-String Correction Problem
DOI: 10.1016/J.ENDM.2010.05.067
description: scientific article; zbMATH DE number 6033965