<--- Back to Details
First PageDocument Content
Phylogenetics / Computational phylogenetics / Unrooted binary tree / Phylogenetic tree / Split / Maximum parsimony / Neighbor joining / Substitution model / Models of DNA evolution / Tree / Binary tree
Date: 2002-12-19 12:20:43
Phylogenetics
Computational phylogenetics
Unrooted binary tree
Phylogenetic tree
Split
Maximum parsimony
Neighbor joining
Substitution model
Models of DNA evolution
Tree
Binary tree

Performance Study of Phylogenetic Methods: (Unweighted) Quartet Methods and Neighbor-Joining Katherine St. John Dept. of Math & Computer Science, Lehman College and the Graduate Center, City U. of New York E-mail: stjohn

Add to Reading List

Source URL: www.cs.unm.edu

Download Document from Source Website

File Size: 170,85 KB

Share Document on Facebook

Similar Documents

Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

DocID: 1uCBo - View Document

TREE STRUCTURES FOR REGION REPRESENTATION  Azriel Rosenfeld and Hanan Samet Computer Vision Laboratory University of Maryland College Park, MD 20742

TREE STRUCTURES FOR REGION REPRESENTATION Azriel Rosenfeld and Hanan Samet Computer Vision Laboratory University of Maryland College Park, MD 20742

DocID: 1rrxI - View Document

Programming Techniques S.L. Graham, R.L. Rivest Editors

Programming Techniques S.L. Graham, R.L. Rivest Editors

DocID: 1rm4m - View Document

Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation ∗ Department Yan Chen∗, Yujing He∗ , Fei Xie∗ and Jin Yang† of Computer Science, Portland State University, Portland, OR 97207. {c

Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation ∗ Department Yan Chen∗, Yujing He∗ , Fei Xie∗ and Jin Yang† of Computer Science, Portland State University, Portland, OR 97207. {c

DocID: 1riqj - View Document

´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1

´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1

DocID: 1r7j1 - View Document