Automata-theoretic models of mutation and alignment.

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

Share this publication in a Topic to start or enrich a Post.

• Share to Base Sequence
• Share to DNA, Satellite
• Share to Frameshift Mutation