PARSIMONY JACKKNIFING OUTPERFORMS NEIGHBOR-JOINING
- PMID: 34920604
- DOI: 10.1111/j.1096-0031.1996.tb00196.x
PARSIMONY JACKKNIFING OUTPERFORMS NEIGHBOR-JOINING
Abstract
Abstract- Because they are designed to produced just one tree, neighbor-joining programs can obscure ambiguities in data. Ambiguities can be uncovered by resampling, but existing neighbor-joining programs may give misleading bootstrap frequencies because they do not suppress zero-length branches and/or are sensitive to the order of terminals in the data. A new procedure, parsimony jackknifing, overcomes these problems while running hundreds of times faster than existing programs for neighbor-joining bootstrapping. For analysis of large matrices, parsimony jackknifing is hundreds of thousands of times faster than extensive branch-swapping, yet is better able to screen out poorly-supported groups.
References
REFERENCES
-
- Albert, V. A. and K. Bremer. 1993. Flying kiwis and pattern information in biogeography. Cur. Biol. 3: 324-325.
-
- Albert, V. A., S. E. Williams, and M. W. Chase. 1992. Carnivorous plants: Phylogeny and structural evolution. Science 257: 1491-1495.
-
- Backeljau, T., L. De Bruyn, H. De Wolf, K., Jordaens, S., Van Dongen, and B. Winnepenninckx. 1996. Multiple UPGMA and neighbor-joining trees and the performance of some computer packages. Mol. Biol. Evol. 13: 309-313.
-
- Bremer, K. 1988. The limits of amino-acid sequence data in angiosperm phylogenetic reconstruction. Evolution 42: 795-803.
-
- Carpenter, J. M. 1996. Uninformative bootstrapping. Cladistics 12 (in press).
LinkOut - more resources
Full Text Sources
