Article
Automata-theoretic models of mutation and alignment.
Proceedings. International Conference on Intelligent Systems for Molecular Biology - 1 Jan 1995
Searls D B, Murphy K P
Abstract excerpt
Finite-state automata called transducers, which have both input and output, can be used to model simple mechanisms of biological mutation. We present a methodology whereby numerically-weighted versions of such specifications can be mechanically adapted to create string edit machines that are essentially equivalent to recurrence relations of the sort that characterize dynamic programming alignment algorithms....
Topics
- Algorithms
- Automation
- Base Sequence
- DNA, Satellite
- Frameshift Mutation
- Markov Chains
- Models, Genetic
- Molecular Sequence Data
- Mutation
- Proteins
- Sequence Deletion
- Software