Doubly-constrained LCS and hybrid-constrained LCS problems revisited

DOI10.1016/J.IPL.2012.04.007zbMATH Open1243.68334OpenAlexW2044289750MaRDI QIDQ436604FDOQ436604

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

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

zbMATH Keywords

algorithmsfinite automatalongest common subsequencecombinatorial problems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The String-to-String Correction Problem
• The constrained longest common subsequence problem
• Variants of constrained longest common subsequence
• On the generalized constrained longest common subsequence problems
• Repetition-free longest common subsequence
• New efficient algorithms for the LCS and constrained LCS problems
• Exemplar Longest Common Subsequence
• Title not available (Why is that?)
• Finite automata based algorithms on subsequences and supersequences of degenerate strings

Cited In (3)

• Title not available (Why is that?)
• Palindromic subsequence automata and longest common palindromic subsequence
• 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)