Consistent subsequences and supersequences

DOI10.1016/0304-3975(95)00138-7MaRDI QIDQ671514zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On finding minimal, maximal, and consistent sequences over a binary alphabet
• Shortest consistent superstrings computable in polynomial time
• Maximal common subsequences and minimal common supersequences
• scientific article; zbMATH DE number 1555947

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Maximal common subsequences and minimal common supersequences
• More on the complexity of common superstring and supersequence problems
• On the approximation of longest common nonsupersequences and shortest common nonsubsequences
• On the complexity of learning strings and sequences
• String Noninclusion Optimization Problems
• The Complexity of Some Problems on Subsequences and Supersequences
• The shortest common nonsubsequence problem is NP-complete
• The shortest common supersequence problem over binary alphabet is NP- complete

Cited in

(3)

• Subsequence Packing: Complexity, Approximation, and Application
• When a constant subsequence implies ultimate periodicity
• scientific article; zbMATH DE number 1555947 (Why is no real title available?)

This page was built for publication: Consistent subsequences and supersequences

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