Protein complex prediction via improved verification methods using constrained domain-domain matching.
この論文をさがす
説明
Identification of protein complexes within protein-protein interaction networks is one of the important objectives in functional genomics. Ozawa et al. proposed a verification method of protein complexes by introducing a structural constraint. In this paper, we propose an improved integer programming-based method based on the idea that a candidate complex should not be divided into many small complexes, and combination methods with maximal components and extreme sets. The results of computational experiments suggest that our methods outperform the method by Ozawa et al. We prove that the verification problems are NP-hard, which justifies the use of integer programming.
収録刊行物
-
- International journal of bioinformatics research and applications
-
International journal of bioinformatics research and applications 8 (3-4), 210-227, 2012-09
Inderscience Enterprises
- Tweet
キーワード
- protein complex prediction
- integer programming
- DDI
- domain-domain interactions
- PPI
- protein-protein interactions
- bioinformatics
- protein complexes
- constrained domain-domain matching
- verification methods
- Algorithms
- Binding Sites
- Databases, Protein
- Protein Interaction Mapping/methods
- Proteins/chemistry
- Proteins/metabolism
詳細情報 詳細情報について
-
- CRID
- 1050001335767091584
-
- NII論文ID
- 110008803119
- 120005243442
-
- NII書誌ID
- AA1208393X
-
- ISSN
- 17445485
- 17445493
-
- HANDLE
- 2433/172236
-
- PubMed
- 22961452
-
- 本文言語コード
- en
-
- 資料種別
- journal article
-
- データソース種別
-
- IRDB
- Crossref
- CiNii Articles
- KAKEN
- OpenAIRE
