Sciweavers

3204 search results - page 580 / 641
» The b-chromatic Number of a Graph
Sort
View
NSDI
2004
13 years 11 months ago
Consistent and Automatic Replica Regeneration
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
Haifeng Yu, Amin Vahdat
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
13 years 11 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
BMCBI
2010
143views more  BMCBI 2010»
13 years 9 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
BMCBI
2010
229views more  BMCBI 2010»
13 years 9 months ago
Mocapy++ - A toolkit for inference and learning in dynamic Bayesian networks
Background: Mocapy++ is a toolkit for parameter learning and inference in dynamic Bayesian networks (DBNs). It supports a wide range of DBN architectures and probability distribut...
Martin Paluszewski, Thomas Hamelryck
BMCBI
2008
114views more  BMCBI 2008»
13 years 9 months ago
A visual analytics approach for understanding biclustering results from microarray data
Background: Microarray analysis is an important area of bioinformatics. In the last few years, biclustering has become one of the most popular methods for classifying data from mi...
Rodrigo Santamaría, Roberto Therón, ...