Consistent subsequences and supersequences

DOI10.1016/0304-3975(95)00138-7zbMath0872.68065OpenAlexW2024642990MaRDI QIDQ671514

Campbell B. Fraser

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00138-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• On the approximation of longest common nonsupersequences and shortest common nonsubsequences
• On the complexity of learning strings and sequences
• The shortest common supersequence problem over binary alphabet is NP- complete
• The shortest common nonsubsequence problem is NP-complete
• More on the complexity of common superstring and supersequence problems
• Maximal common subsequences and minimal common supersequences
• The Complexity of Some Problems on Subsequences and Supersequences
• String Noninclusion Optimization Problems

This page was built for publication: Consistent subsequences and supersequences