Towards Inferring Protein Interactions: Challenges and Solutions
Discovering interacting proteins has been an essential part of functional genomics. However, existing experimental techniques only uncover a small portion of any interactome. Furthermore, these data often have a very high false rate. By conceptualizing the interactions at domain level, we provide a...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1790 http://asp.eurasipjournals.com/content/2006/1/037349/abstract |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-2789 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-27892013-03-15T10:12:03Z Towards Inferring Protein Interactions: Challenges and Solutions ZHANG, Ya ZHA, Hongyuan CHU, Chao-Hsien JI, Xiang CHEN, X. W. Discovering interacting proteins has been an essential part of functional genomics. However, existing experimental techniques only uncover a small portion of any interactome. Furthermore, these data often have a very high false rate. By conceptualizing the interactions at domain level, we provide a more abstract representation of interactome, which also facilitates the discovery of unobserved protein-protein interactions. Although several domain-based approaches have been proposed to predict protein-protein interactions, they usually assume that domain interactions are independent on each other for the convenience of computational modeling. A new framework to predict protein interactions is proposed in this paper, where no assumption is made about domain interactions. Protein interactions may be the result of multiple domain interactions which are dependent on each other. A conjunctive norm form representation is used to capture the relationships between protein interactions and domain interactions. The problem of interaction inference is then modeled as a constraint satisfiability problem and solved via linear programing. Experimental results on a combined yeast data set have demonstrated the robustness and the accuracy of the proposed algorithm. Moreover, we also map some predicted interacting domains to three-dimensional structures of protein complexes to show the validity of our predictions. 2006-04-01T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/1790 info:doi/10.1155/ASP/2006/37349 http://asp.eurasipjournals.com/content/2006/1/037349/abstract Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Bioinformatics Computer Sciences |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Bioinformatics Computer Sciences |
spellingShingle |
Bioinformatics Computer Sciences ZHANG, Ya ZHA, Hongyuan CHU, Chao-Hsien JI, Xiang CHEN, X. W. Towards Inferring Protein Interactions: Challenges and Solutions |
description |
Discovering interacting proteins has been an essential part of functional genomics. However, existing experimental techniques only uncover a small portion of any interactome. Furthermore, these data often have a very high false rate. By conceptualizing the interactions at domain level, we provide a more abstract representation of interactome, which also facilitates the discovery of unobserved protein-protein interactions. Although several domain-based approaches have been proposed to predict protein-protein interactions, they usually assume that domain interactions are independent on each other for the convenience of computational modeling. A new framework to predict protein interactions is proposed in this paper, where no assumption is made about domain interactions. Protein interactions may be the result of multiple domain interactions which are dependent on each other. A conjunctive norm form representation is used to capture the relationships between protein interactions and domain interactions. The problem of interaction inference is then modeled as a constraint satisfiability problem and solved via linear programing. Experimental results on a combined yeast data set have demonstrated the robustness and the accuracy of the proposed algorithm. Moreover, we also map some predicted interacting domains to three-dimensional structures of protein complexes to show the validity of our predictions. |
format |
text |
author |
ZHANG, Ya ZHA, Hongyuan CHU, Chao-Hsien JI, Xiang CHEN, X. W. |
author_facet |
ZHANG, Ya ZHA, Hongyuan CHU, Chao-Hsien JI, Xiang CHEN, X. W. |
author_sort |
ZHANG, Ya |
title |
Towards Inferring Protein Interactions: Challenges and Solutions |
title_short |
Towards Inferring Protein Interactions: Challenges and Solutions |
title_full |
Towards Inferring Protein Interactions: Challenges and Solutions |
title_fullStr |
Towards Inferring Protein Interactions: Challenges and Solutions |
title_full_unstemmed |
Towards Inferring Protein Interactions: Challenges and Solutions |
title_sort |
towards inferring protein interactions: challenges and solutions |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2006 |
url |
https://ink.library.smu.edu.sg/sis_research/1790 http://asp.eurasipjournals.com/content/2006/1/037349/abstract |
_version_ |
1770571499331125248 |