Minimal mutation trees of sequences
D Sankoff - SIAM Journal on Applied Mathematics, 1975 - SIAM
SIAM Journal on Applied Mathematics, 1975•SIAM
Given a finite tree, some of whose vertices are identified with given finite sequences, we
show how to construct sequences for all the remaining vertices simultaneously, so as to
minimize the total edge-length of the tree. Edge-length is calculated by a metric whose
biological significance is the mutational distance between two sequences.
show how to construct sequences for all the remaining vertices simultaneously, so as to
minimize the total edge-length of the tree. Edge-length is calculated by a metric whose
biological significance is the mutational distance between two sequences.
Given a finite tree, some of whose vertices are identified with given finite sequences, we show how to construct sequences for all the remaining vertices simultaneously, so as to minimize the total edge-length of the tree. Edge-length is calculated by a metric whose biological significance is the mutational distance between two sequences.
Society for Industrial and Applied Mathematics