Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle Richard Desper1 and Olivier Gascuel2

First Page		Document Content
Date: 2003-08-28 11:10:57 Binary trees Mathematics Science Neighbor joining Maximum parsimony Spanning tree Tree R-tree B-tree Phylogenetics Graph theory Computational phylogenetics		Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle Richard Desper1 and Olivier Gascuel2 Add to Reading List Source URL: www.ncbi.nlm.nih.gov Download Document from Source Website File Size: 230,77 KB Share Document on Facebook

	Appendix: Indexing the binary voting trees under amendment agendas 29th November 2013 This is an appendix to Lehtinen (forthcoming): “Strategic voting and the degree of path-dependence”, Group Decision and Negotiatio DocID: 1tXh7 - View Document
	Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees Dimitrios Siakavaras, Konstantinos Nikas, Georgios Goumas and Nectarios Koziris National Technical University of Athens School of Electrica DocID: 1tNbp - View Document
	Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees Dimitrios Siakavaras, Konstantinos Nikas, Georgios Goumas and Nectarios Koziris National Technical University of Athens (NTUA) School of El DocID: 1tBBN - View Document
	S AARLAND U NIVERSITY Binary Search Trees, Rectangles and Patterns László KOZMA DocID: 1sTRF - View Document
	Programming Techniques S.L. Graham, R.L. Rivest Editors DocID: 1rm4m - View Document