Sciweavers

38 search results - page 2 / 8
» tcbb 2008
Sort
View
TCBB
2010
166views more  TCBB 2010»
13 years 3 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
2010
107views more  TCBB 2010»
13 years 3 months ago
A Metric on the Space of Reduced Phylogenetic Networks
—Phylogenetic networks are leaf-labeled, rooted, acyclic, directed graphs, that are used to model reticulate evolutionary histories. Several measures for quantifying the topologi...
Luay Nakhleh
TCBB
2008
101views more  TCBB 2008»
13 years 4 months ago
Improved Layout of Phylogenetic Networks
Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal-angle algorithm is used to draw such networks, producing layouts that leave much room f...
Philippe Gambette, Daniel H. Huson
TCBB
2008
73views more  TCBB 2008»
13 years 4 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
TCBB
2008
76views more  TCBB 2008»
13 years 4 months ago
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...
Michael D. Hendy, Sagi Snir