Reconstructing (super)trees from data sets with missing distances: not all is lost.

Area of Science:

• Phylogenetics
• Bioinformatics
• Computational Biology

Background:

• Phylogenetic research relies on extensive biological data.
• Advances in molecular sequencing generate vast datasets.
• Handling missing data is a critical challenge in phylogenetic analysis.

Purpose of the Study:

• Introduce Lasso, a novel heuristic approach for phylogenetic tree reconstruction.
• Address the challenge of missing data in distance matrices.
• Develop a method for reconstructing rooted trees and supertrees from partial datasets.

Main Methods:

• Lasso utilizes a heuristic approach for reconstructing rooted phylogenetic trees.
• The method operates on distance matrices with missing values, assuming a molecular clock.
• It restricts the leaf set to a large subset of taxa, ensuring unique and edge-weighted trees.

Main Results:

• Lasso demonstrates effectiveness in reconstructing trees from datasets with missing data.
• The approach is distance-based, ensuring speed and scalability for large datasets.
• Lasso performs comparably or better than leading supertree algorithms on challenging biological data.

Conclusions:

• Lasso provides a robust solution for phylogenetic tree reconstruction with missing data.
• The method is efficient, scalable, and produces unique, edge-weighted trees.
• Freely available software enables researchers to perform rooted tree and supertree reconstruction on their own datasets.