The MultiFurcating Neighbor-Joining Algorithm for Reconstructing Polytomic Phylogenetic Trees

Area of Science:

• Evolutionary biology
• Bioinformatics
• Computational biology

Background:

• Phylogenetic trees are crucial for understanding species evolution.
• The neighbor-joining (NJ) algorithm is a common method for reconstructing phylogenetic trees.
• NJ algorithm's reliance on input order can lead to biased or varied tree outputs.

Purpose of the Study:

• To address the bias and reproducibility issues in phylogenetic tree reconstruction using the NJ algorithm.
• To introduce a generalized version of the NJ algorithm capable of handling multifurcating branches.

Main Methods:

• Generalized the formulas of the neighbor-joining (NJ) algorithm.
• Developed the multifurcating neighbor-joining (MFNJ) algorithm to produce polytomic phylogenetic trees.
• Demonstrated the MFNJ algorithm's ability to yield a single, consistent tree regardless of input order.

Main Results:

• The MFNJ algorithm successfully reconstructs polytomic phylogenetic trees.
• MFNJ eliminates the dependency on the input order of taxa, preventing biased results.
• MFNJ ensures a unique and reproducible phylogenetic tree output.

Conclusions:

• The MFNJ algorithm offers a more robust and unbiased approach to phylogenetic tree reconstruction.
• MFNJ enhances the reproducibility of evolutionary studies by providing a single, consistent tree.
• This method addresses a significant limitation of traditional distance-based phylogenetic reconstruction techniques.