On the complexity of learning strings and sequences
From MaRDI portal
Publication:688167
DOI10.1016/0304-3975(93)90167-RzbMATH Open0787.68088MaRDI QIDQ688167FDOQ688167
Publication date: 28 November 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- The Complexity of Learning SUBSEQ (A)
- The complexity of learning SUBSEQ(A)
- scientific article; zbMATH DE number 1336330
- On the complexity of random strings
- Adaptive learning of compressible strings
- scientific article; zbMATH DE number 5957322
- Exact bounds on the complexity of sequential string matching algorithms
- On the kernelization complexity of string problems
- On the kernelization complexity of string problems
- Complexity of strings in the class of Markov sources
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)
Cites Work
Cited In (13)
- Approximating shortest superstrings with constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- String Matching: Communication, Circuits, and Learning.
- Approximating shortest superstrings with constraints
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences
- A new graph model and algorithms for consistent superstring problems
- DNA sequencing and string learning
- The complexity of learning SUBSEQ(A)
- Title not available (Why is that?)
- The Complexity of Learning SUBSEQ (A)
- Consistent subsequences and supersequences
- Shortest consistent superstrings computable in polynomial time
This page was built for publication: On the complexity of learning strings and sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688167)
