A Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis

Authors:
D. Ruchkys;S. Song
Affiliations:
-;-
Venue:
SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
Year:
2002

Citing 0
Cited 4

Linear kernelizations for restricted 3-Hitting Set problems

Information Processing Letters
A kernelization algorithm for d-Hitting Set

Journal of Computer and System Sciences
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Theoretical Computer Science
Kernelization algorithms for d-hitting set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the recent DNA-microarray technology, it is possibleto measure the expression levels of thousands of genessimultaneously in the same experiment. A genetic networkis a model that describes how the expression level of eachgene is affected by the expression levels of other genes in thenetwork. Given the results of an experiment with n genesand m measures over time (m