A parallel approximation hitting set algorithm for gene expression analysis

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn 2002-January, Issue , 2002, Pages 75-81

  Ruchkys, D P ^a   Song, S W ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Algorithm design and analysis; Approximation algorithms; Computer networks; DNA computing; Gene expression; Genetics; Monitoring; Space technology; Time measurement; User generated content

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BIOINFORMATICS; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; GENES; MONITORING; NETWORK ARCHITECTURE; TIME MEASUREMENT;

ALGORITHM DESIGN AND ANALYSIS; DNA-COMPUTING; GENETICS; SPACE TECHNOLOGIES; USER-GENERATED CONTENT;

GENE EXPRESSION;

EID: 84906852570     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CAHPC.2002.1180762     Document Type: Conference Paper

References (12)

1. H. A. Armelin, J. Barrera, E. R. Dougherty, M. D. Gubitoso, N. S. T. Hirata, and E. J. Neves. Simulator for gene expression networks. In Proceedings of SPIE - BIOS 2001. SPIE, 2001.
2. J. Barrera, E. R. Dougherty, M. D. Gubitoso, and N. S. T. Hirata. Modeling temporal morphological systems via lattice dynamical systems. In Electronic Imaging at SPIE Photonics. SPIE, 2001.
3. F. Dehne. Coarse grained parallel algorithms. Algorithmica, 24(3/4):173-176, 2000.
4. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multi-computers. In Proc. ACM 9th Annual Computational Geometry, pages 298-307, 1993.
5. P. D'haeseleer, S. Liang, and R. Somogyi. Gene expression data analysis and modeling. Tutorial notes from Pacific Symposium on Biocomputing, 1999.
6. C. G. Fernandes, F. K. Miyazawa, M. R. Cerioli, and P. Feofiloff, editors. Uma Introdução Sucinta a Algoritmos de Aproximação. IMPA, 2001.
7. M. R. Garey and D. S. Johnson. Computers and intractability - A guide to the theory of NP-completeness. W.H. Freeman and Company, 21th edition, 1999.
8. D. S. Hochbaum, editor. Aproximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.
9. T. E. Ideker, V. Thorsson, and R. M. Karp. Discovery of regulatory interactions through perturbation: inference and experimental design. Pacific Symposium on Biocomputing 5:302-313, 2000.
10. S. Jha, O. Sheyner, and J. M. Wing. Minimization and reliability analyses of attack graphs. IEEE Symposium on Security and Privacy, 2002.
11. S. Liang, S. Fuhrman, and R. Somogyi. Reveal, a general reverse engineering algorithm for inference of genetic network architectures. Pacific Symposium on Biocomputing 3:18-29, 1998.
12. L. Valiant. A bridging model for parallel computation. Communication of the ACM, 33(8):103-111, 1990.