Sciweavers

77 search results - page 1 / 16
» Reconstructing Phylogenetic Networks Using Maximum Parsimony
Sort
View
CSB
2005
IEEE
141views Bioinformatics» more  CSB 2005»
13 years 10 months ago
Reconstructing Phylogenetic Networks Using Maximum Parsimony
Phylogenies—the evolutionary histories of groups of organisms—are one of the most widely used tools throughout the life sciences, as well as objects of research within systema...
Luay Nakhleh, Guohua Jin, Fengmei Zhao, John M. Me...
TCBB
2010
166views more  TCBB 2010»
13 years 2 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
TCBB
2008
122views more  TCBB 2008»
13 years 4 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
BMCBI
2007
165views more  BMCBI 2007»
13 years 4 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
TCBB
2008
107views more  TCBB 2008»
13 years 4 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...