Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/15698
Title: | Efficient discovery of binding motif pairs from protein-protein interactions | Authors: | LI HAIQUAN | Keywords: | Protein interaction sites, binding motif pairs, fixed point model, stable motif pairs, significant motif pairs, interacting protein group pairs. | Issue Date: | 12-Jan-2007 | Citation: | LI HAIQUAN (2007-01-12). Efficient discovery of binding motif pairs from protein-protein interactions. ScholarBank@NUS Repository. | Abstract: | Protein interaction sites mediate protein interactions. Current methods to determine protein interaction sites are still preliminary. This dissertation introduces a new motif concept, called binding motif pairs, to model regular patterns located at protein interaction sites. We propose two different approaches to mining binding motif pairs from protein interaction data. The first method is based on a fixed-point theory where a motif pair is defined as a point of the transformation function. The fixed points of the transformation function that are also statistically significant are the binding motif pairs. The second method is built on an all-versus-all interaction relationship between two protein groups in protein interaction networks. This idea reflects an inherent binding mechanism between proteins. We call those groups with all-versus-all relationship interacting protein group pairs and use a data mining method to efficiently discover them. The binding motif pairs are generated from the group pairs using standard motif discovery algorithms. The effectiveness of the two methods is demonstrated by comprehensive validation results. | URI: | http://scholarbank.nus.edu.sg/handle/10635/15698 |
Appears in Collections: | Ph.D Theses (Open) |
Show full item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
haiquandissertation.pdf | 1.39 MB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.