Dispersal routes reconstruction and the minimum cost arborescence problem

DOI10.1016/J.JTBI.2012.06.007MaRDI QIDQ2632050zbMATH OpenOpenAlexWikidataFDO

Authors Wim Hordijk, Olivier Broennimann

Publication date 14 May 2019

Published in Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jtbi.2012.06.007

zbMATH Keywords

dispersal routesinvasive speciesminimum cost arborescence

Mathematics Subject Classification ID

Ecology (92D40)

Recommendations

• Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
• Shortest connectivity. An introduction with applications in phylogeny.
• Parsimonious migration history problem: complexity and algorithms
• Robustness of minimum cost arborescences
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion

Cites work

• Finding optimum branchings
• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 3906496 (Why is no real title available?)
• scientific article; zbMATH DE number 3583044 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• scientific article; zbMATH DE number 3285076 (Why is no real title available?)
• scientific article; zbMATH DE number 3373559 (Why is no real title available?)
• Optimum branchings
• RANDOM DISPERSAL IN THEORETICAL POPULATIONS

This page was built for publication: Dispersal routes reconstruction and the minimum cost arborescence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632050)