PSODA: Better Tasting and Less Filling Than PAUP
暂无分享,去创建一个
[1] O. Gotoh. Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. , 1996, Journal of molecular biology.
[2] P. Goloboff. Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima , 1999, Cladistics : the international journal of the Willi Hennig Society.
[3] D. Swofford. PAUP*: Phylogenetic analysis using parsimony (*and other methods), Version 4.0b10 , 2002 .
[4] D. Maddison,et al. NEXUS: an extensible file format for systematic information. , 1997, Systematic biology.
[5] R. Sokal,et al. A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY , 1965 .
[6] J. Thompson,et al. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. , 1994, Nucleic acids research.
[7] Sean R. Eddy,et al. ATV: display and manipulation of annotated phylogenetic , 2001, Bioinform..
[8] James F. Smith. Phylogenetics of seed plants : An analysis of nucleotide sequences from the plastid gene rbcL , 1993 .
[9] D. Lipman,et al. Rapid and sensitive protein similarity searches. , 1985, Science.
[10] M. P. Cummings,et al. PAUP* Phylogenetic analysis using parsimony (*and other methods) Version 4 , 2000 .
[11] Hyrum Carroll,et al. Using Parsimony to Guide Maximum Likelihood Searches , 2007, 2007 IEEE 7th International Symposium on BioInformatics and BioEngineering.
[12] Sudhir Kumar,et al. MEGA: Molecular Evolutionary Genetics Analysis software for microcomputers , 1994, Comput. Appl. Biosci..
[13] H. Kishino,et al. Evaluation of the maximum likelihood estimate of the evolutionary tree topologies from DNA sequence data, and the branching order in hominoidea , 1989, Journal of Molecular Evolution.
[14] Fredrik Ronquist. Fast Fitch-Parsimony Algorithms for Large Data Sets , 1998 .
[15] K. Nixon,et al. The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis , 1999, Cladistics : the international journal of the Willi Hennig Society.
[16] Perry G. Ridge,et al. Large Grain Size Stochastic Optimization Alignment , 2006, Sixth IEEE Symposium on BioInformatics and BioEngineering (BIBE'06).
[17] R. Doolittle,et al. Progressive sequence alignment as a prerequisitetto correct phylogenetic trees , 2007, Journal of Molecular Evolution.
[18] David S. Gladstein,et al. Efficient Incremental Character Optimization , 1997, Cladistics : the international journal of the Willi Hennig Society.
[19] S. B. Needleman,et al. A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.
[20] Pablo A. Goloboff,et al. CHARACTER OPTIMIZATION AND CALCULATION OF TREE LENGTHS , 1993 .
[21] J. Felsenstein. Evolutionary trees from DNA sequences: A maximum likelihood approach , 2005, Journal of Molecular Evolution.
[22] G. Giribet,et al. TNT: Tree Analysis Using New Technology , 2005 .
[23] David Sankoff,et al. A tree · a window · a hill; generalization of nearest-neighbor interchange in phylogenetic optimization , 1994 .
[24] Hyrum Carroll,et al. PsodaScript: Applying Advanced Language Constructs to Open-source Phylogenetic Search , 2007 .