DNA sequencing and string learning

DOI10.1007/BF01192694MaRDI QIDQ3445271zbMATH OpenFDO

Authors Tao Jiang, Ming Li

Publication date 11 June 2007

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

Full work available at URL https://doi.org/10.1007/BF01192694

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

• scientific article; zbMATH DE number 67609 (Why is no real title available?)
• scientific article; zbMATH DE number 67610 (Why is no real title available?)
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A greedy approximation algorithm for constructing shortest common superstrings
• A theory of the learnable
• Approximating shortest superstrings with constraints
• Approximation algorithms for the shortest common superstring problem
• Deductive learning
• Learnability and the Vapnik-Chervonenkis dimension
• Learning in the Presence of Malicious Errors
• Mapping the genome
• Occam's razor
• On finding minimal length superstrings
• On the complexity of learning strings and sequences
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework

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)