ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 298, Issue 1, 4 April 2003, Pages 235-251
Selected Papers in honour of Setsuo Arikawa
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (232 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0304-3975(02)00425-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science B.V. All rights reserved.

Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model*1

Tatsuya AkutsuE-mail The Corresponding Author, a, Satoru KuharaE-mail The Corresponding Author, b, Osamu MaruyamaE-mail The Corresponding Author, c and Satoru MiyanoCorresponding Author Contact Information, E-mail The Corresponding Author, a

a Human Genome Center, Institute of Medical Science, University of Tokyo, 4-6-1 Shirokanedai, Minato-ku, Tokyo 108-8639, Japan b Graduate School of Genetic Resources Technology, Kyushu University, Hakozaki 6-10-1, Higashi-ku, Fukuoka 812-8581, Japan c Graduate School of Mathematics, Kyushu University, Hakozaki 6-10-1, Higashi-ku, Fukuoka 812-8581, Japan

Available online 22 January 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Analysis of the interactions between genes by systematic gene disruptions and gene overexpressions is an important topic in molecular biology. This paper analyses the problem of identifying a genetic network from the data obtained by multiple gene disruptions and overexpressions in regard to the number of experiments and the complexity of experiments. An experiment consists of simultaneous gene disruptions and overexpressions and the complexity of an experiment is the number of genes disrupted or overexpressed. We define a genetic network as a boolean network and show a series of algorithms which describe methods for identifying the underlying genetic network by such experiments. Some lower bounds on the number of experiments required for the identification are also proved for some cases.

Author Keywords: Genetic network; Gene expression; Computational biology; Boolean network


Theoretical Computer Science
Volume 298, Issue 1, 4 April 2003, Pages 235-251
Selected Papers in honour of Setsuo Arikawa
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.