Cart (Loading....) | Create Account
Close category search window

Identifying genetically spliced languages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kim, S.M. ; Dept. of Comput. Eng., Kyungpook Nat. Univ., Taegu, South Korea

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

Published in:

Evolutionary Computation, 1997., IEEE International Conference on

Date of Conference:

13-16 Apr 1997

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.