Sciweavers

548 search results - page 26 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
BMCBI
2007
99views more  BMCBI 2007»
15 years 1 months ago
Orthogonal projections to latent structures as a strategy for microarray data normalization
Background: During generation of microarray data, various forms of systematic biases are frequently introduced which limits accuracy and precision of the results. In order to prop...
Max Bylesjö, Daniel Eriksson, Andreas Sjö...
BMCBI
2010
132views more  BMCBI 2010»
15 years 1 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
BMCBI
2010
175views more  BMCBI 2010»
15 years 1 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
IPPS
2008
IEEE
15 years 8 months ago
An adaptive parallel pipeline pattern for grids
This paper introduces an adaptive parallel pipeline pattern which follows the GRASP (Grid-Adaptive Structured Parallelism) methodology. GRASP is a generic methodology to incorpora...
Horacio González-Vélez, Murray Cole
103
Voted
CCGRID
2007
IEEE
15 years 8 months ago
Relative Performance of Scheduling Algorithms in Grid Environments
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
Yang Zhang, Charles Koelbel, Ken Kennedy