Neighbor Joining And Leaf Status - Algorithmique Discrète et Applications Access content directly
Preprints, Working Papers, ... Year : 2023

Neighbor Joining And Leaf Status

Abstract

The Neighbor Joining Algorithm is among the most fundamental algorithmic results in computational biology. However, its definition and correctness proof are not straightforward. In particular, "the question "what does the NJ method seek to do?" has until recently proved somewhat elusive" [Gascuel & Steel, 2006]. While a rigorous mathematical analysis is now available, it is still considered somewhat hard to follow and its proof tedious at best. In this work, we present an alternative interpretation of the goal of the Neighbor Joining algorithm by proving that it chooses to merge the two taxa u and v that maximize the "leaf-status", that is, the sum of distances of all leaves to the unique u-v-path.
Fichier principal
Vignette du fichier
nj.pdf (90.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04109091 , version 1 (29-05-2023)
hal-04109091 , version 2 (30-05-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-04109091 , version 1

Cite

Mathias Weller. Neighbor Joining And Leaf Status. 2023. ⟨hal-04109091v1⟩
41 View
30 Download

Share

Gmail Facebook X LinkedIn More