Faster exact maximum parsimony search with XMP-Reference-Cited by-同舟云学术

Faster exact maximum parsimony search with XMP

Published:2011-03-27 Issue:10 Volume:27 Page:1359-1367
ISSN:1460-2059
Container-title:Bioinformatics
language:en
Short-container-title:

Author:

White W. Timothy J.,Holland Barbara R.

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Statistics and Probability

Link

http://academic.oup.com/bioinformatics/article-pdf/27/10/1359/16898871/btr147.pdf

Reference47 articles.

1. Computing steiner minimum trees in Hamming metric;Althaus,2006

2. Lower bounds for maximum parsimony with gene order data;Bachrach,2005

3. ExactMP: an efficient parallel exact solver for phylogenetic tree reconstruction using maximum parsimony;Bader;Proceedings of the International Conference on Parallel Processing,2006

4. Scheduling multithreaded computations by work stealing;Blumofe;J. ACM,1999

5. A subdivision approach to maximum parsimony;Bruen;Ann. Combinatorics,2008

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

1. PhylogeneticGraph (PhyG) a new phylogenetic graph search and optimization program;Cladistics;2023-10-19

2. A new phylogenetic protocol: dealing with model misspecification and confirmation bias in molecular phylogenetics;NAR Genomics and Bioinformatics;2020-06-01

3. A new phylogenetic protocol: Dealing with model misspecification and confirmation bias in molecular phylogenetics;2018-08-27

4. Live phylogeny with polytomies: Finding the most compact parsimonious trees;Computational Biology and Chemistry;2017-08

5. Computer science and parsimony: a reappraisal, with discussion of methods for poorly structured datasets;Cladistics;2014-06-06