Sciweavers

1199 search results - page 23 / 240
» Robust inference of trees
Sort
View
TCBB
2008
122views more  TCBB 2008»
13 years 10 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...
WABI
2010
Springer
168views Bioinformatics» more  WABI 2010»
13 years 7 months ago
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
Jesper Jansson, Richard S. Lemence, Andrzej Lingas
BIBE
2008
IEEE
101views Bioinformatics» more  BIBE 2008»
13 years 12 months ago
Ontology-inferred phylogeny reconstruction for analyzing the evolutionary relationships between species: Ontological inference v
We propose the use of formal ontological inferencing, rather than cladistics, to reconstruct phylogeny trees and to analyze the evolutionary relationships between species. For this...
Arash Shaban-Nejad, Volker Haarslev
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 3 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 4 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha