Finite state machine for mutation
نویسندگان
چکیده
In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of finite state machines. The mutation is studied systematically and an automaton have been constructed with the biological sequences. It has also been shown that the automaton constructed is the minimal state automaton. DNA sequences are represented as regular expressions. A case study with FMR-1 gene is presented as an illustration.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملN-Policy for M/G/1 Machine Repair Model with Mixed Standby Components, Degraded Failure and Bernoulli Feedback
In this paper, we study N-policy for a finite population Bernoulli feedback queueing model for machine repair problem with degraded failure. The running times of the machines between breakdowns have an exponential distribution. The repair times of the machines are independent and identically distributed random variables. If at any time a machine fails, it is sent to the repairman for repairing,...
متن کاملMutation testing from probabilistic and stochastic finite state machines
Specification mutation involves mutating a specification, and for each mutation a test is derived that distinguishes the behaviours of the mutated and original specifications. This approach has been applied with finite state machines based models. This paper extends mutation testing to finite state machine models that contain non-functional properties. The paper describes several ways of mutati...
متن کاملProcessing Mutations in Breton with Finite-State Transducers
One characteristic feature of Celtic languages is mutation, i.e. the fact that the initial consonant of words may change according to the context. We provide a quick description of this linguistic phenomenon for Breton along with a formalization using finite state transducers. This approach allows an exact and compact description of mutations. The result can be used in various contexts, especia...
متن کاملA Genetic Algorithm for Finite State Automata
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. The aim of this paper is to describe and analyze the behavior of an implementation of a non-deterministic finite-state acceptor using a genetic algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008