On identifying DNA splicing systems from examples

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 642 LNAI, Issue , 1992, Pages 305-319

  Takada, Yuji ^a   Siromoney, Rani ^a,b  

^a FUJITSU LABORATORIES LTD   (Japan)

^b MADRAS CHRISTIAN COLLEGE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; DNA SEQUENCES; ENZYMES;

DETERMINISTIC FINITE STATE AUTOMATA; DNA SPLICING; FINITE ALPHABET; INDUCTIVE INFERENCE; LEARNING METHODS; LIGASES; RESTRICTION ENZYMES; SPLICING SYSTEMS;

LEARNING SYSTEMS;

EID: 85029427255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56004-1_21     Document Type: Conference Paper

References (5)

1. K. Culik II and T. Harju. Splicing semigroups of dominoes and DNA. Discrete Applied Mathematics, 31: 261-277, 1991.
2. T. Head. Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology, 49(6): 737-759, 1987.
3. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.
4. L. Pitt. Inductive inference, dfas, and computational complexity. In K. P. Jantke, editor, Proceedings of 2nd Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, 397, pages 18-44. Springer-Verlag, 1989.
5. J. D. Watson, J. Tooze, and D. T. Kurtz. Recombinant DNA: A Short Course. Freeman, New York, 1983.