scientific article

zbMath1399.68317MaRDI QIDQ2970219

Sebastian Deorowicz, Joanna Obstój

Publication date: 29 March 2017

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

zbMATH Keywords

string matchingsequence alignmentlongest common subsequencesparse dynamic programmingconstrained longest common subsequence

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (6)

A dynamic programming solution to a generalized LCS problem ⋮ An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints ⋮ An \(A^\ast\) search algorithm for the constrained longest common subsequence problem ⋮ Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion ⋮ A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint ⋮ Constrained sequence analysis algorithms in computational biology

This page was built for publication: