Consistent subsequences and supersequences
From MaRDI portal
Publication:671514
DOI10.1016/0304-3975(95)00138-7zbMATH Open0872.68065OpenAlexW2024642990MaRDI QIDQ671514FDOQ671514
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- The Complexity of Some Problems on Subsequences and Supersequences
- More on the complexity of common superstring and supersequence problems
- The shortest common supersequence problem over binary alphabet is NP- complete
- The shortest common nonsubsequence problem is NP-complete
- Maximal common subsequences and minimal common supersequences
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences
- String Noninclusion Optimization Problems
- On the complexity of learning strings and sequences
Cited In (3)
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)