ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(トランザクション)
  2. Bioinformatics(TBIO)
  3. Vol.48
  4. No.SIG5(TBIO2)

A Biclustering Method for Gene Expression Module Discovery Using a Closed Itemset Enumeration Algorithm

https://ipsj.ixsq.nii.ac.jp/records/18607
https://ipsj.ixsq.nii.ac.jp/records/18607
12720923-2924-4d5d-9095-0611700a7f9d
名前 / ファイル ライセンス アクション
IPSJ-TBIO4805006.pdf IPSJ-TBIO4805006.pdf (884.7 kB)
Copyright (c) 2007 by the Information Processing Society of Japan
オープンアクセス
Item type Trans(1)
公開日 2007-03-15
タイトル
タイトル A Biclustering Method for Gene Expression Module Discovery Using a Closed Itemset Enumeration Algorithm
タイトル
言語 en
タイトル A Biclustering Method for Gene Expression Module Discovery Using a Closed Itemset Enumeration Algorithm
言語
言語 eng
キーワード
主題Scheme Other
主題 Original Papers
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Computational Biology Research Center (CBRC) National Institute of Advanced Industrial Science and Technology (AIST)
著者所属
Computational Biology Research Center (CBRC) National Institute of Advanced Industrial Science and Technology (AIST)
著者所属
Computational Bio
著者所属(英)
en
Computational Biology Research Center (CBRC), National Institute of Advanced Industrial Science and Technology (AIST)
著者所属(英)
en
Computational Biology Research Center (CBRC), National Institute of Advanced Industrial Science and Technology (AIST)
著者所属(英)
en
Computational Biology Research Center (CBRC), National Institute of Advanced Industrial Science and Technology (AIST)
著者名 Yoshifumi, Okada Wataru, Fujibuchi Paul, Horton

× Yoshifumi, Okada Wataru, Fujibuchi Paul, Horton

Yoshifumi, Okada
Wataru, Fujibuchi
Paul, Horton

Search repository
著者名(英) Yoshifumi, Okada Wataru, Fujibuchi Paul, Horton

× Yoshifumi, Okada Wataru, Fujibuchi Paul, Horton

en Yoshifumi, Okada
Wataru, Fujibuchi
Paul, Horton

Search repository
論文抄録
内容記述タイプ Other
内容記述 A gene expression module (module for short) is a set of genes with shared expression behavior under certain experimental conditions. Discovering of modules enables us to uncover the function of uncharacterized genes or genetic networks. In recent years several biclustering methods have been suggested to discover modules from gene expression data matrices where a bicluster is defined as a subset of genes that exhibit a highly correlated expression pattern over a subset of conditions. Biclustering however involves combinatorial optimization in selecting the rows and columns composing modules. Hence most existing algorithms are based on heuristic or stochastic approaches and produce possibly sub-optimal solutions. In this paper we propose a novel biclustering method BiModule based on a closed itemset enumeration algorithm. By exhaustive enumeration of such biclusters it is possible to select only biclusters satisfying certain criteria such as a user-specified bicluster size an enrichment of functional annotation terms etc. We performed comparative experiments to existing salient biclustering methods to test the validity of biclusters extracted by BiModule using synthetic data and real expression data. We show that BiModule provides high performance compared to the other methods in extracting artificially-embedded modules as well as modules strongly related to GO annotations protein-protein interactions and metabolic pathways.
論文抄録(英)
内容記述タイプ Other
内容記述 A gene expression module (module for short) is a set of genes with shared expression behavior under certain experimental conditions. Discovering of modules enables us to uncover the function of uncharacterized genes or genetic networks. In recent years, several biclustering methods have been suggested to discover modules from gene expression data matrices, where a bicluster is defined as a subset of genes that exhibit a highly correlated expression pattern over a subset of conditions. Biclustering however involves combinatorial optimization in selecting the rows and columns composing modules. Hence most existing algorithms are based on heuristic or stochastic approaches and produce possibly sub-optimal solutions. In this paper, we propose a novel biclustering method, BiModule, based on a closed itemset enumeration algorithm. By exhaustive enumeration of such biclusters, it is possible to select only biclusters satisfying certain criteria such as a user-specified bicluster size, an enrichment of functional annotation terms, etc. We performed comparative experiments to existing salient biclustering methods to test the validity of biclusters extracted by BiModule using synthetic data and real expression data. We show that BiModule provides high performance compared to the other methods in extracting artificially-embedded modules as well as modules strongly related to GO annotations, protein-protein interactions and metabolic pathways.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA12177013
書誌情報 IPSJ Transactions on Bioinformatics (TBIO)

巻 48, 号 SIG5(TBIO2), p. 39-48, 発行日 2007-03-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-6679
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-22 22:39:17.449557
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3