Doubly-constrained LCS and hybrid-constrained LCS problems revisited

DOI10.1016/j.ipl.2012.04.007zbMath1243.68334OpenAlexW2044289750MaRDI QIDQ436604

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

algorithmscombinatorial problemsfinite automatalongest common subsequence

Mathematics Subject Classification ID

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

Related Items (3)

Palindromic subsequence automata and longest common palindromic subsequence ⋮ A hardness result and new algorithm for the longest common palindromic subsequence problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Variants of constrained longest common subsequence
• On the generalized constrained longest common subsequence problems
• New efficient algorithms for the LCS and constrained LCS problems
• Finite automata based algorithms on subsequences and supersequences of degenerate strings
• The constrained longest common subsequence problem
• Exemplar Longest Common Subsequence
• The String-to-String Correction Problem
• Repetition-free longest common subsequence

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