Sciweavers

450 search results - page 34 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 11 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
BMCBI
2008
104views more  BMCBI 2008»
14 years 12 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
CEEMAS
2005
Springer
15 years 5 months ago
Multiagents Applied to Humanitarian Demining
Abstract. The complexity associated to Humanitarian Demining becomes very high due to its broad set of activities, which beyond the already complex of landmine removal, includes ot...
Pedro Santana, José Barata, Luís Flo...
IPPS
2008
IEEE
15 years 6 months ago
SLA-based resource allocation in cluster computing systems
Resource allocation is a fundamental but challenging problem due to the complexity of cluster computing systems. In enterprise service computing, resource allocation is often asso...
Kaiqi Xiong, Harry G. Perros
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
15 years 6 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