Branch and bound algorithms to determine minimal evolutionary trees-Reference-Cited by-同舟云学术

Branch and bound algorithms to determine minimal evolutionary trees

Published:1982-06 Issue:2 Volume:59 Page:277-290
ISSN:0025-5564
Container-title:Mathematical Biosciences
language:en
Short-container-title:Mathematical Biosciences

Author:

Hendy M.D.,Penny David

Publisher

Elsevier BV

Subject

Applied Mathematics,General Agricultural and Biological Sciences,General Immunology and Microbiology,General Biochemistry, Genetics and Molecular Biology,Modeling and Simulation,General Medicine,Statistics and Probability

Reference11 articles.

1. Phylogenetic analysis: models and estimation procedures;Cavalli-Sforza;Evolution,1967

2. Toward defining the course of evolution: minimum change for a specific tree topology;Fitch;Syst. Zool.,1971

3. On the problem of discovering the most parsimonious tree;Fitch;Amer. Nat.,1977

4. Evolutionary trees with minimum nucleotide replacements from amino and sequences;Fitch;J. Mol. Evol.,1974

5. A graph theoretic approach to the development of minimal phylogenetic trees;Foulds;J. Mol. Evol.,1979

Cited by 446 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. David Penny (1938–2024);Nature Ecology & Evolution;2024-09-10

2. The Tree Reconstruction Game: Phylogenetic Reconstruction Using Reinforcement Learning;Molecular Biology and Evolution;2024-06-01

3. Leaping through Tree Space: Continuous Phylogenetic Inference for Rooted and Unrooted Trees;Genome Biology and Evolution;2023-12-01

4. Spare Parts Inventory Optimization for Wind Farms;2023 International Annual Conference on Complex Systems and Intelligent Science (CSIS-IAC);2023-10-20

5. A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem;Computers & Operations Research;2023-10