The combinatorics of evolutionary trees---a survey
From MaRDI portal
Publication:5947452
zbMATH Open0978.05532MaRDI QIDQ5947452
László A. Székely, Péter L. Erdős, Mike A. Steel
Publication date: 5 November 2001
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121534
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Trees (05C05) Problems related to evolution (92D15) Taxonomy, cladistics, statistics in mathematical biology (92B10)
Related Items (7)
The evolution of the structure of ABC-minimal trees ⋮ Combinatorial views on persistent characters in phylogenetics ⋮ A combinatorial description of the closest tree algorithm for finding evolutionary trees ⋮ Asymptotic enumeration, global structure, and constrained evolution ⋮ The number of evolutionary steps on random and minimum length trees for random evolutionary data ⋮ Unnamed Item ⋮ Ancestors and descendants in evolving k‐tree models
This page was built for publication: The combinatorics of evolutionary trees---a survey
