DocumentCode
1870509
Title
Identifying genetically spliced languages
Author
Kim, Sam M.
Author_Institution
Dept. of Comput. Eng., Kyungpook Nat. Univ., Taegu, South Korea
fYear
1997
fDate
13-16 Apr 1997
Firstpage
231
Lastpage
235
Abstract
A genetic splicing system involves DNA strings mixed with enzymes and a ligase that allow the strings to be cleaved and recombined to produce new strings in addition to the original ones. This paper presents an algorithm which, given a set of enzymes and a set I of DNA strings in terms of the reduced finite state automaton which recognizes the set, decides whether I can be spliced with the given enzymes and a finite number of DNA strings or not. The paper also shows how to find the initial DNA strings, if the answer is positive
Keywords
DNA; finite state machines; genetic algorithms; genetics; proteins; DNA strings; enzymes; genetic splicing system; genetically spliced languages; ligase; reduced finite state automaton; Abstracts; Automata; Biochemistry; DNA; Formal languages; Genetic engineering; Splicing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1997., IEEE International Conference on
Conference_Location
Indianapolis, IN
Print_ISBN
0-7803-3949-5
Type
conf
DOI
10.1109/ICEC.1997.592301
Filename
592301
Link To Document