DNA sequencing and string learning

DOI10.1007/BF01192694zbMATH Open1111.68458MaRDI QIDQ3445271FDOQ3445271

Tao Jiang, Ming Li

Publication date: 11 June 2007

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Learnability and the Vapnik-Chervonenkis dimension
• A greedy approximation algorithm for constructing shortest common superstrings
• Deductive learning
• A theory of the learnable
• Title not available (Why is that?)
• Mapping the genome
• Occam's razor
• Learning in the Presence of Malicious Errors
• On finding minimal length superstrings
• Approximation algorithms for the shortest common superstring problem
• Approximating shortest superstrings with constraints
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Title not available (Why is that?)
• On the complexity of learning strings and sequences
• Title not available (Why is that?)

Cited In (5)

• CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
• Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
• Adaptive learning of compressible strings
• Shortest consistent superstrings computable in polynomial time
• Sharpening Occam's razor

This page was built for publication: DNA sequencing and string learning

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