The constrained longest common subsequence problem
type: Item
instance of: scholarly article
title: The constrained longest common subsequence problem
zbMATH Open document ID: 1175.90407
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5576889
zbMATH Keywords: constrained longest common subsequence problems
zbMATH Keywords: algorithms
zbMATH Keywords: dynamic programming
author: Yin Te Tsai
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.07.001
OpenAlex ID: W1999395788
cites work: Q4349101
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: Q4347080
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: A faster algorithm computing string edit distances
cites work: The String-to-String Correction Problem
DOI: 10.1016/J.IPL.2003.07.001
description: scientific article; zbMATH DE number 5576889