Sökning: "Maximum homeomorphic subtrees"
Hittade 1 avhandling innehållade orden Maximum homeomorphic subtrees.
1. Constructing Evolutionary Trees - Algorithms and Complexity
Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER
Resultatsidor:
1