LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

First Page		Document Content
Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony		LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Download Document from Source Website File Size: 402,58 KB Share Document on Facebook

	Molecular Phylogenetics and Evolution Vol. 16, No. 1, July, pp. 143–160, 2000 doi:mpev, available online at http://www.idealibrary.com on Resolution of Phylogenetic Relationships among Recently Evolve DocID: 1vhfU - View Document
	IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, Tanglegrams: A Reduction Tool for Mathematical Phylogenetics Frederick A. Matsen IV , Sara C. Billey, Arnold Kas, and Matja DocID: 1v8mY - View Document
	Molecular Phylogenetics and Evolution–395 Contents lists available at SciVerse ScienceDirect Molecular Phylogenetics and Evolution journal homepage: www.elsevier.com/locate/ympev DocID: 1uYPa - View Document
	Introduction to phylogenetics using Thibaut Jombart ∗ Imperial College London DocID: 1uQb8 - View Document
	Molecular Phylogenetics and Evolution–1203 Contents lists available at ScienceDirect Molecular Phylogenetics and Evolution journal homepage: www.elsevier.com/locate/ympev DocID: 1uHiD - View Document