Abstract
DNA sequences are recombined with restriction enzymes and ligases. Splicing systems, generative devices introduced by Head [2], represent this DNA recombinant behaviors as operations on pairs of strings over a finite alphabet. Culik II and Harju [1] proved that a language generated by a splicing system is regular. We give a method to construct a splicing system from a deterministic finite state automaton. By combining a conventional inductive inference/ learning method for deterministic finite state automata with our method, we have an effective inductive inference/learning method for splicing systems.
This work has been done during the author visit to FUJITSU LABORATORIES LTD.
Preview
Unable to display preview. Download preview PDF.
References
K. Culik II and T. Harju. Splicing semigroups of dominoes and DNA. Discrete Applied Mathematics, 31:261–277, 1991.
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.
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.
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.
J. D. Watson, J. Tooze, and D. T. Kurtz. Recombinant DNA: A Short Course. Freeman, New York, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takada, Y., Siromoney, R. (1992). On identifying DNA splicing systems from examples. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1992. Lecture Notes in Computer Science, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56004-1_21
Download citation
DOI: https://doi.org/10.1007/3-540-56004-1_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56004-3
Online ISBN: 978-3-540-47339-8
eBook Packages: Springer Book Archive