Computational algorithms for evolutionary trees and related applications
The purpose of this study is to use the notion of trees of graph theory in some useful applications to solve some problems in evolution, mathematics, and the problem of minimal connector.
The Wagner method developed by Farris (1970) is used as a basis for the study. Computer programs written in FORTRAN by the author implement the method to construct the evolutionary tree for a group of organisms and show the relation between the members of the group.
Modification is made to the FORTRAN programs along with additional subroutines to apply to the tree of the Greatest Common Divisor and the Least Common Multiple of a set of numbers.
Another modification is made to solve the problem of minimal connector in general and the traveling salesman in particular.
A separate program is developed to implement Sollin's algorithm for the problem of minimal connector.
Final results are shown in the form of trees in the text, while instructions are given in the documentation to construct trees for these results from the programs' output.
Thesis74.T333.pdf
2.64 MB
Adobe PDF
7785bbb042ec4670b7f1d94149b7f55d