Sciweavers

3600 search results - page 717 / 720
» The settling-time reducibility ordering
Sort
View
ALGORITHMICA
2011
13 years 2 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
ANOR
2011
175views more  ANOR 2011»
13 years 2 months ago
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
Fred Glover, Lawrence H. Cox, Rahul Patil, James P...
BMCBI
2011
13 years 2 months ago
iPhy: an integrated phylogenetic workbench for supermatrix analyses
Background: The increasing availability of molecular sequence data means that the accuracy of future phylogenetic studies is likely to by limited by systematic bias and taxon choi...
Martin O. Jones, Georgios D. Koutsovoulos, Mark L....
BMCBI
2011
13 years 2 months ago
Investigating the effect of paralogs on microarray gene-set analysis
Background: In order to interpret the results obtained from a microarray experiment, researchers often shift focus from analysis of individual differentially expressed genes to an...
Andre J. Faure, Cathal Seoighe, Nicola J. Mulder
BMCBI
2011
13 years 2 months ago
Systematic error detection in experimental high-throughput screening
Background: High-throughput screening (HTS) is a key part of the drug discovery process during which thousands of chemical compounds are screened and their activity levels measure...
Plamen Dragiev, Robert Nadon, Vladimir Makarenkov