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

	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
	Consortium for Comparative Genomics! University of Colorado School of Medicine Phylogenetics BIOL 7711 Computational Bioscience DocID: 1rKd5 - View Document
	3. About R2oDNA Designer Please read these publications for more details: Casini A, Christodoulou G, Freemont PS, Baldwin GS, Ellis T, MacDonald JT. R2oDNA Designer: Computational design of biologically-neutral synthetic DocID: 1rrqE - View Document
	September 14, :56 WSPC - Proceedings Trim Size: 9.75in x 6.5in DocID: 1rpn4 - View Document
	A Pipeline for Computational Historical Linguistics Lydia Steiner Peter F. Stadler DocID: 1roQe - View Document