Bit-parallel algorithm for the constrained longest common subsequence problem

DOI10.3233/FI-2010-256MaRDI QIDQ4932075zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 6697960
• The constrained longest common subsequence problem
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
• A simple algorithm for the constrained sequence problems
• A fast algorithm of constrained longest common subsequence

Cited in

(8)

• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
• Quadratic-time algorithm for a string constrained LCS problem
• Mining Bit-Parallel LCS-length Algorithms
• Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
• Bit-parallel algorithms for the merged longest common subsequence problem
• A diagonal-based algorithm for the longest common increasing subsequence problem
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• Constrained sequence analysis algorithms in computational biology

This page was built for publication: Bit-parallel algorithm for the constrained longest common subsequence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932075)