Towards a DNA sequencing theory (learning a string)
- 4 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Learning nested differences of intersection-closed concept classesMachine Learning, 1990
- Approximation algorithms for the shortest common superstring problemInformation and Computation, 1989
- A theory of learning simple concepts under simple distributions and average case complexity for the universal distributionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Learning in the presence of malicious errorsPublished by Association for Computing Machinery (ACM) ,1988
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987
- Recent Results on Boolean Concept LearningPublished by Elsevier BV ,1987
- A theory of the learnableCommunications of the ACM, 1984
- Deductive learningPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1984
- Automation of the computer handling of gel reading data produced by the shotgun method of DNA sequencingNucleic Acids Research, 1982