Sciweavers

1099 search results - page 24 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
15 years 4 months ago
Bringing evolutionary computation to industrial applications with guide
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...
Luís Da Costa, Marc Schoenauer
CP
2005
Springer
15 years 3 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 10 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
RECOMB
2009
Springer
15 years 4 months ago
Reconstructing Histories of Complex Gene Clusters on a Phylogeny
Abstract. Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analy...
Tomás Vinar, Brona Brejová, Giltae S...
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Whole Genome Phylogeny Based on Clustered Signature String Composition
Peptide compositions constructed out of whole sets of protein sequences can be used as species signatures for phylogenetic analysis. To account for point mutations, an amino acid ...
Xiaomeng Wu, Guohui Lin, Xiu-Feng Wan, Dong Xu