Issue No. 08 - August (2005 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.134
The binding in protein-protein interactions exhibits a kind of biochemical stability in cells. The mathematical notion of fixed points also describes stability. A point is a fixed point if it remains unchanged after a transformation by a function. Many points may not be a fixed point, but they may approach a stable status after multiple steps of transformation. In this paper, we define a point as a protein motif pair consisting of two traditional protein motifs. We propose a function and propose a method to discover stable motif pairs of this function from a large protein interaction sequence data set. There are many interesting properties for this function (for example, the convergence). Some of them are useful for gaining much efficiency in the discovery of those stable motif pairs; some are useful for explaining why our proposed fixed point theorems are a good way to model the binding of protein interactions. Our results are also compared to biological results to elaborate the effectiveness of our method.
Index Terms- Bioinformatics (genome or protein) database, mining methods and algorithms, generating functions, stability and instability, biology and genetics.
Haiquan Li, Jinyan Li, "Using Fixed Point Theorems to Model the Binding in Protein-Protein Interactions", IEEE Transactions on Knowledge & Data Engineering, vol. 17, no. , pp. 1079-1087, August 2005, doi:10.1109/TKDE.2005.134