Sciweavers

666 search results - page 66 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
CAV
2003
Springer
160views Hardware» more  CAV 2003»
14 years 2 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
BMCBI
2010
135views more  BMCBI 2010»
13 years 9 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
CCCG
2003
13 years 10 months ago
Linear Binary Space Partitions and the Hierarchy of Object Classes
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
Petr Tobola, Karel Nechvíle
FLAIRS
2004
13 years 10 months ago
Inducing Fuzzy Decision Trees in Non-Deterministic Domains using CHAID
Most decision tree induction methods used for extracting knowledge in classification problems are unable to deal with uncertainties embedded within the data, associated with human...
Jay Fowdar, Zuhair Bandar, Keeley A. Crockett