Why phylogenies compress so well: combinatorial guarantees under the Infinite Sites Model
This paper establishes a formal framework proving that under the Infinite Sites Model, the NP-hard problem of optimizing genome orderings for phylogenetic compression becomes polynomially solvable via Neighbor Joining, thereby mathematically explaining the high efficacy of tree-based heuristics in bacterial genomics.