Growing Phylogenetic Trees Using Hierarchical Clustering
We compare mitochondrial DNA of different species to build a phylogenetic tree. The main challenge is that the calculation of the Levenshtein distance is very slow for large sequences. We introduce an approximate scheme which uses Levenshtein for lower-level details and a fast distance based on sequence length for high-level attributes. The tree is built using average linkage hierarchical clustering.
bioinformatics↗