Sciweavers

2756 search results - page 545 / 552
» Parallel Mesh Generation
Sort
View
BMCBI
2006
157views more  BMCBI 2006»
13 years 7 months ago
Determination of the minimum number of microarray experiments for discovery of gene expression patterns
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...
Fang-Xiang Wu, W. J. Zhang, Anthony J. Kusalik
CGF
2006
202views more  CGF 2006»
13 years 7 months ago
GPU-based Collision Detection for Deformable Parameterized Surfaces
Based on the potential of current programmable GPUs, recently several approaches were developed that use the GPU to calculate deformations of surfaces like the folding of cloth or...
Alexander Greß, Michael Guthe, Reinhard Klei...
BMCBI
2007
132views more  BMCBI 2007»
13 years 7 months ago
Analysis of probe level patterns in Affymetrix microarray data
Background: Microarrays have been used extensively to analyze the expression profiles for thousands of genes in parallel. Most of the widely used methods for analyzing Affymetrix ...
Alexander C. Cambon, Abdelnaby Khalyfa, Nigel G. F...
BMCBI
2007
152views more  BMCBI 2007»
13 years 7 months ago
Recodon: Coalescent simulation of coding DNA sequences with recombination, migration and demography
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
Miguel Arenas, David Posada
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 7 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma