Fitting a geometric graph to a protein–protein interaction network
نویسندگان
چکیده
منابع مشابه
Fitting a geometric graph to a protein-protein interaction network
MOTIVATION Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between network structure and biological function as well as into evolution. Also, network (graph) models are used to guide biological experiments and discover new biological features. It has been proposed that geometric rando...
متن کاملA Decomposition Approach to Geometric Fitting
Many geometric fitting problems encountered in computer vision are of non-linear nature and have a large number of parameters. Typically, iterative techniques such as the Levenberg-Marquardt algorithm are used to compute the optimum of highly complex optimization functions. Here we are faced with problems of good initial estimates and high risk of getting in local optimums. In this paper we pro...
متن کاملA New Approach to Geometric Fitting
Geometric fitting — parameter estimation for data subject to implicit parametric constraints — is a very common sub-problem in computer vision, used for curve, surface and 3D model fitting, matching constraint estimation and 3D reconstruction under constraints. Although many algorithms exist for specific cases, the general problem is by no means ‘solved’ and has recently become a subject of con...
متن کاملCombiMotif: A new algorithm for network motifs discovery in proteinprotein interaction networks
Discovering motifs in protein–protein interaction networks is becoming a current major challenge in computational biology, since the distribution of the number of network motifs can reveal significant systemic differences among species. However, this task can be computationally expensive because of the involvement of graph isomorphic detection. In this paper, we present a new algorithm (CombiMo...
متن کاملFitting a graph to vector data Citation
We introduce a measure of how well a combinatorial graph fits a collection of vectors. The optimal graphs under this measure may be computed by solving convex quadratic programs and have many interesting properties. For vectors in d dimensional space, the graphs always have average degree at most 2(d+1), and for vectors in 2 dimensions they are always planar. We compute these graphs for many st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2008
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btn079