A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint

DOI10.3390/a6030485zbMath1461.68273OpenAlexW2052437266MaRDI QIDQ1736579

Daxin Zhu, Xiao-dong Wang

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6030485

zbMATH Keywords

dynamic programmingconstrained LCSstring-excluding

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Dynamic programming (90C39) Algorithms on strings (68W32)

Related Items (2)

A hardness result and new algorithm for the longest common palindromic subsequence problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Quadratic-time algorithm for a string constrained LCS problem
• On the generalized constrained longest common subsequence problems
• A new efficient algorithm for computing the longest common subsequence
• The constrained longest common subsequence problem
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• Fast Pattern Matching in Strings
• AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS

This page was built for publication: A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint