The Constrained Longest Common Subsequence Problem for Degenerate Strings

DOI10.1007/978-3-540-76336-9_30zbMath1137.68621OpenAlexW1746697883MaRDI QIDQ3503920

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

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

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

Related Items (3)

Computing the longest common almost-increasing subsequence ⋮ Indeterminate string inference algorithms ⋮ Unnamed Item

Cites Work

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

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