DNA sequencing and string learning

Theory of Computing Systems

Volumn 29, Issue 4, 1996, Pages 387-405

  Jiang, Tao ^a   Li, Ming ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DNA; GENE ENCODING; LEARNING ALGORITHMS; STRING THEORY;

DISTRIBUTION-FREE; EFFICIENT LEARNING; LEARNING MODELS; MATHEMATICAL FRAMEWORKS; NEGATIVE EXAMPLES; PLAUSIBLE ASSUMPTIONS; QUANTITATIVE BOUNDS; SHORTEST COMMON SUPERSTRINGS;

DNA SEQUENCES;

EID: 0012748276     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01192694     Document Type: Article

References (22)

1. D. Angluin and P. D. Laird. Learning from noisy examples. Machine Learning 2(4), 343-370, 1988.
2. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear approximation of shortest superstrings. To appear in Journal of the ACM; also presented at 23rd ACM Symp. on Theory of Computing, New Orleans, 1991.
3. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear approximation of shortest superstrings. To appear in Journal of the ACM; also presented at 23rd ACM Symp. on Theory of Computing, New Orleans, 1991.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Occam's razor. Information Processing Letters 24, 377-380, 1987.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and Vapnik-Chervonenkis dimension. Journal of the ACM 35(4), 1989.
6. V. Chvátal. A greedy heuristic for the set covering problem. Mathematics of Operations Research 4(3), 1979.
7. R. Drmanac and C. Crkvenjakov. Sequencing by hybridization (SBH) with oligonucleotide probes as an integral approach for the analysis of complex genomes. International Journal of Cenomic Research 1(1), 59-79, 1992.
8. D. Freifelder. Molecular Biology. Jones & Bartlett, 1983.
9. P. Freidland and L. Kedes. Discovering the secrets of DNA. Communications of the ACM 28(11), 1164-1186, 1985.
10. J. Gallant, D. Maier, and J. Storer. On finding minimal length superstring. Journal of Computer and System Sciences 20, 50-58, 1980.
11. M. Garey and D. Johnson. Computers and Intractability. Freeman, New York, 1979.
12. D. Haussler. Quantifying inductive bias: AI learning algorithms and Valiant's model. Artificial Intelligence 36(2), 177-221, 1988.
13. D. Helmbold, R. Sloan, and M. Warmuth. Learning nested differences of intersection-closed classes. Proc. 2nd Workshop on Computational Learning Theory, pp. 41-56, 1989.
14. T. Jiang and M. Li. On the complexity of learning strings and sequences. Theoretical Computer Science 119, 363-371, 1993.
15. T. Jiang and M. Li. Approximating shortest superstrings with constraints. To appear in Theoretical Computer Science.
16. R. Karp, Mapping the genome: some combinatorial problems arising in molecular biology. Proc. 23rd ACM Symp. on Theory of Computing, pp. 278-285, 1993.
17. M. Kearns. The computational complexity of machine learning. Ph.D. Thesis, Report TR-13-89, Harvard University, 1989.
18. M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing 22(4), 807-837, 1993.
19. M. Kearns, M. Li, L. Pitt, and L. G. Valiant. On the learnability of Boolean formulae. Proc. 19th ACM Symp. on Theory of Computing, pp. 285-295, 1987.
20. G. Landau and U. Vishkin. Efficient string matching in the presence of errors. Proc. 26th IEEE Symp. on Foundations of Computer Science, pp. 126-136, 1985.
21. A. Lesk (editor). Computational Molecular Biology, Sources and Methods for Sequence Analysis. Oxford University Press, Oxford, 1988.
22. M. Li. Towards a DNA sequencing theory. Proc. 31st IEEE Symp. on Foundations of Computer Science, pp. 125-134, 1990.