The Constrained Longest Common Subsequence Problem for Degenerate Strings

DOI10.1007/978-3-540-76336-9_30MaRDI QIDQ3503920zbMATH OpenOpenAlexFDO

Authors Costas S. Iliopoulos, M. Sohel Rahman, Michal Voráček, Ladislav Vagner

Publication date 10 June 2008

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-76336-9_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Recommendations

• The constrained longest common subsequence problem
• On the generalized constrained longest common subsequence problems
• On solving a generalized constrained longest common subsequence problem
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• scientific article; zbMATH DE number 6697960
• Variants of constrained longest common subsequence
• scientific article; zbMATH DE number 6161102
• The longest common subsequence problem revisited
• A fast algorithm of constrained longest common subsequence

Cites work

• A simple algorithm for the constrained sequence problems
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
• The constrained longest common subsequence problem

Cited in

(4)

• The finite automata approaches in stringology
• Finite automata based algorithms on subsequences and supersequences of degenerate strings
• Indeterminate string inference algorithms
• Computing the longest common almost-increasing subsequence

This page was built for publication: The Constrained Longest Common Subsequence Problem for Degenerate Strings

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