Growing Phylogenetic Trees Using Hierarchical Clustering
Abstract
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.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Organism
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- TreeCluster: clustering biological sequences using phylogenetic trees
Metin Balaban, Niema Moshiri, … Siavash Mirarab·PLoS ONEPeer-reviewed·Aug 22, 2019
- Scalable distance-based phylogeny inference using divide-and-conquer
Lars Arvestad·bioRxiv·Oct 11, 2023
- k-Nearest Common Leaves algorithm for phylogenetic tree completion
Aleksandr Koshkarov, Nadia Tahiri·bioRxiv·Apr 4, 2026
- Machine learning based imputation techniques for estimating phylogenetic trees from incomplete distance matrices
Ananya Bhattacharjee, Md. Shamsuzzoha Bayzid·BMC GenomicsPeer-reviewed·Jul 20, 2020
- Spectral Cluster Supertree: fast and statistically robust merging of rooted phylogenetic trees
R A McArthur, Ahad N. Zehmakan, … Gavin A. Huttley·Frontiers in Molecular BiosciencesPeer-reviewed·Oct 30, 2024
- PhytClust: Efficient and Optimal Monophyletic Partitioning of Rooted Phylogenetic Trees
Katyayni Ganesan, Elisa Billard, … Roland F. Schwarz·bioRxiv·Apr 27, 2026