Normalization of affine gap costs used in optimal sequence alignment.

Abstract

It is shown how to normalize the costs of an alignment algorithm that employs affine or linear gap costs. The normalized costs are interpreted as the -log probabilities of the instructions of a finite-state edit-machine. This gives an explicit model relating sequences that can be linked to processes of mutation and evolution. 

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.