scientific article

zbMath1213.90263MaRDI QIDQ3517653

Abhilash Singireddy, Todd Easton

Publication date: 12 August 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingbranch and boundlongest common subsequence

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39)

Related Items (5)

Beam search for the longest common subsequence problem ⋮ A hyper-heuristic for the longest common subsequence problem ⋮ Efficient solutions for the far from most string problem ⋮ An improved algorithm for the longest common subsequence problem ⋮ Anytime algorithms for the longest common palindromic subsequence problem

This page was built for publication: