Algorithms for two versions of LCS problem for indeterminate strings

MaRDI QIDQ3565916zbMATH OpenFDO

Authors Costas S. Iliopoulos, M. Sohel Rahman, Wojciech Rytter

Publication date 7 June 2010

zbMATH Keywords

Longest Common Subsequence

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• New efficient algorithms for the LCS and constrained LCS problems
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• The longest common subsequence problem revisited
• On the generalized constrained longest common subsequence problems
• On the Set LCS and Set-Set LCS Problems

Cited in

(6)

• An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
• Algorithms on strings. Translated from the 2001 French original
• Doubly-constrained LCS and hybrid-constrained LCS problems revisited
• Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
• Constrained sequence analysis algorithms in computational biology
• Finite automata based algorithms on subsequences and supersequences of degenerate strings

This page was built for publication: Algorithms for two versions of LCS problem for indeterminate strings

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