کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7380233 | 1480157 | 2014 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
CombiMotif: A new algorithm for network motifs discovery in protein-protein interaction networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: CombiMotif: A new algorithm for network motifs discovery in protein-protein interaction networks CombiMotif: A new algorithm for network motifs discovery in protein-protein interaction networks](/preview/png/7380233.png)
چکیده انگلیسی
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 (CombiMotif) that incorporates combinatorial techniques to count non-induced occurrences of subgraph topologies in the form of trees. The efficiency of our algorithm is demonstrated by comparing the obtained results with the current state-of-the art subgraph counting algorithms. We also show major differences between unicellular and multicellular organisms. The datasets and source code of CombiMotif are freely available upon request.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 416, 15 December 2014, Pages 309-320
Journal: Physica A: Statistical Mechanics and its Applications - Volume 416, 15 December 2014, Pages 309-320
نویسندگان
Jiawei Luo, Guanghui Li, Dan Song, Cheng Liang,