Computational complexity of inferring phylogenies from chromosome inversion data-Reference-Cited by-同舟云学术

Computational complexity of inferring phylogenies from chromosome inversion data

Published:1987-01 Issue:2 Volume:124 Page:213-218
ISSN:0022-5193
Container-title:Journal of Theoretical Biology
language:en
Short-container-title:Journal of Theoretical Biology

Author:

Day William H.E.,Sankoff 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. Computationally difficult parsimony problems in phylogenetic systematics;Day;J. theor. Biol.,1983

2. Computational complexity of inferring phylogenies by compatibility;Day;Syst. Zool.,1986

3. The computational complexity of inferring rooted phylogenies by parsimony;Day;Math. Biosci.,1986

4. When are two qualitative taxonomic characters compatible?;Estabrook;J. math. Biol.,1977

5. When is one estimate of evolutionary relationships a refinement of another?;Estabrook;J. math. Biol.,1980

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

1. A new (old) approach to genotype-based phylogenomic inference within species, with an example from the saguaro cactus (Carnegiea gigantea);2020-06-19

2. APPLES: Scalable Distance-Based Phylogenetic Placement with or without Alignments;Systematic Biology;2019-09-23

3. Large-scale mammalian genome rearrangements coincide with chromatin interactions;Bioinformatics;2019-07

4. APPLES: Scalable Distance-based Phylogenetic Placement with or without Alignments;2018-11-23

5. On the rank-distance median of 3 permutations;BMC Bioinformatics;2018-05