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.
No takes yet. Share an insight, caveat, or question.
David Sankoff (1975) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: