A dynamic programming solution to a generalized LCS problem

DOI10.1016/j.ipl.2013.07.005zbMath1284.68711arXiv1301.7183OpenAlexW2086175577MaRDI QIDQ2445236

Lei Wang, Daxin Zhu, Yingjie Wu, Xiao-dong Wang

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.7183

zbMATH Keywords

dynamic programmingdesign of algorithmslongest common subsequencegeneralized LCS

Mathematics Subject Classification ID

Dynamic programming (90C39) Algorithms on strings (68W32)

Related Items (3)

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints ⋮ Faster STR-EC-LCS Computation ⋮ A space efficient algorithm for the longest common subsequence in \(k\)-length substrings

Cites Work

• 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
• A simple algorithm for the constrained sequence problems
• Fast Pattern Matching in Strings
• AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS
• Unnamed Item
• Unnamed Item

This page was built for publication: A dynamic programming solution to a generalized LCS problem