Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem

DOI10.3233/FI-2010-256zbMath1204.68279OpenAlexW1566604942MaRDI QIDQ4932075

Sebastian Deorowicz

Publication date: 1 October 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-256

zbMATH Keywords

dynamic programminglongest common subsequenceconstrained longest common subsequencebit-parallel algorithm

Mathematics Subject Classification ID

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

Related Items (4)

Quadratic-time algorithm for a string constrained LCS problem ⋮ Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion ⋮ Constrained sequence analysis algorithms in computational biology ⋮ A diagonal-based algorithm for the longest common increasing subsequence problem

This page was built for publication: Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem