Doubly-constrained LCS and hybrid-constrained LCS problems revisited

DOI10.1016/J.IPL.2012.04.007MaRDI QIDQ436604zbMATH OpenOpenAlexFDO

Authors Effat Farhana, M. Sohel Rahman

Publication date 25 July 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2012.04.007

zbMATH Keywords

algorithmsfinite automatalongest common subsequencecombinatorial problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• Variants of constrained longest common subsequence
• On the generalized constrained longest common subsequence problems
• New efficient algorithms for the LCS and constrained LCS problems
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• Algorithms for Computing Variants of the Longest Common Subsequence Problem

Cites work

• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Algorithms for two versions of LCS problem for indeterminate strings
• Exemplar Longest Common Subsequence
• Finite automata based algorithms on subsequences and supersequences of degenerate strings
• New efficient algorithms for the LCS and constrained LCS problems
• On the generalized constrained longest common subsequence problems
• Repetition-free longest common subsequence
• The String-to-String Correction Problem
• The constrained longest common subsequence problem
• Variants of constrained longest common subsequence

Cited in

(3)

• Palindromic subsequence automata and longest common palindromic subsequence
• Computing longest common square subsequences
• A hardness result and new algorithm for the longest common palindromic subsequence problem

This page was built for publication: Doubly-constrained LCS and hybrid-constrained LCS problems revisited

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