DNA sequencing and string learning

DOI10.1007/BF01192694zbMath1111.68458MaRDI QIDQ3445271

Tao Jiang, Ming Li

Publication date: 11 June 2007

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

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

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

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