Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions

Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano

Research output: Contribution to conferencePaper

76 Citations (Scopus)

Abstract

A hot research topic in Genome Science is to analyze the interactions between genes by systematic gene disruptions and gene overexpressions. This paper analyzes the problem of identifying a gene regulatory network from data obtained by multiple gene disruptions and overexpressions in regard to the number of experiments and the complexity of experiments. An experiment consists of a parallel gene disruptions and overexpressions and the complexity of an experiment is the number of genes disrupted or overexpressed. We define a gene regulatory network as a boolean network and show a series of algorithms which describe methods for identifying the underlying gene regulatory network by such experiments. Some lower bounds on the number of experiments required for the identification are also proved for some cases.

Original languageEnglish
Pages695-702
Number of pages8
Publication statusPublished - Dec 1 1998
Externally publishedYes
EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: Jan 25 1998Jan 27 1998

Other

OtherProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period1/25/981/27/98

Fingerprint

Gene Regulatory Network
Genes
Gene
Experiment
Experiments
Boolean Networks
Genome
Lower bound
Series
Interaction

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Cite this

Akutsu, T., Kuhara, S., Maruyama, O., & Miyano, S. (1998). Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions. 695-702. Paper presented at Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .

Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions. / Akutsu, Tatsuya; Kuhara, Satoru; Maruyama, Osamu; Miyano, Satoru.

1998. 695-702 Paper presented at Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .

Research output: Contribution to conferencePaper

Akutsu, T, Kuhara, S, Maruyama, O & Miyano, S 1998, 'Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions', Paper presented at Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1/25/98 - 1/27/98 pp. 695-702.
Akutsu T, Kuhara S, Maruyama O, Miyano S. Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions. 1998. Paper presented at Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .
Akutsu, Tatsuya ; Kuhara, Satoru ; Maruyama, Osamu ; Miyano, Satoru. / Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions. Paper presented at Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, .8 p.
@conference{e16dd1d4d88b412e907ce3605f97e99d,
title = "Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions",
abstract = "A hot research topic in Genome Science is to analyze the interactions between genes by systematic gene disruptions and gene overexpressions. This paper analyzes the problem of identifying a gene regulatory network from data obtained by multiple gene disruptions and overexpressions in regard to the number of experiments and the complexity of experiments. An experiment consists of a parallel gene disruptions and overexpressions and the complexity of an experiment is the number of genes disrupted or overexpressed. We define a gene regulatory network as a boolean network and show a series of algorithms which describe methods for identifying the underlying gene regulatory network by such experiments. Some lower bounds on the number of experiments required for the identification are also proved for some cases.",
author = "Tatsuya Akutsu and Satoru Kuhara and Osamu Maruyama and Satoru Miyano",
year = "1998",
month = "12",
day = "1",
language = "English",
pages = "695--702",
note = "Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms ; Conference date: 25-01-1998 Through 27-01-1998",

}

TY - CONF

T1 - Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions

AU - Akutsu, Tatsuya

AU - Kuhara, Satoru

AU - Maruyama, Osamu

AU - Miyano, Satoru

PY - 1998/12/1

Y1 - 1998/12/1

N2 - A hot research topic in Genome Science is to analyze the interactions between genes by systematic gene disruptions and gene overexpressions. This paper analyzes the problem of identifying a gene regulatory network from data obtained by multiple gene disruptions and overexpressions in regard to the number of experiments and the complexity of experiments. An experiment consists of a parallel gene disruptions and overexpressions and the complexity of an experiment is the number of genes disrupted or overexpressed. We define a gene regulatory network as a boolean network and show a series of algorithms which describe methods for identifying the underlying gene regulatory network by such experiments. Some lower bounds on the number of experiments required for the identification are also proved for some cases.

AB - A hot research topic in Genome Science is to analyze the interactions between genes by systematic gene disruptions and gene overexpressions. This paper analyzes the problem of identifying a gene regulatory network from data obtained by multiple gene disruptions and overexpressions in regard to the number of experiments and the complexity of experiments. An experiment consists of a parallel gene disruptions and overexpressions and the complexity of an experiment is the number of genes disrupted or overexpressed. We define a gene regulatory network as a boolean network and show a series of algorithms which describe methods for identifying the underlying gene regulatory network by such experiments. Some lower bounds on the number of experiments required for the identification are also proved for some cases.

UR - http://www.scopus.com/inward/record.url?scp=0032277733&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032277733&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0032277733

SP - 695

EP - 702

ER -