Mining the Largest Quasi-clique in Human Protein Interactome
A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module of vertices within a graph. However, in many real-world situations, the classical problem of finding a clique is required to be relaxed. This motivates the problem of finding quasicliques that are almost com...
Saved in:
| Published in | Nature precedings |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
03.04.2012
|
| Online Access | Get full text |
| ISSN | 1756-0357 1756-0357 |
| DOI | 10.1038/npre.2012.7125.1 |
Cover
| Abstract | A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module of vertices within a graph. However, in many real-world situations, the classical problem of finding a clique is required to be relaxed. This motivates the problem of finding quasicliques that are almost complete subgraphs of a graph. In sparse and very large scale-free networks, the problem of finding the largest quasi-clique becomes hard to manage with the existing approaches. Here, we propose a heuristic algorithm in this paper for locating the largest quasi-clique from the human protein-protein interaction networks. The results show promise in computational biology research by the exploration of significant protein modules. |
|---|---|
| AbstractList | A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module of vertices within a graph. However, in many real-world situations, the classical problem of finding a clique is required to be relaxed. This motivates the problem of finding quasicliques that are almost complete subgraphs of a graph. In sparse and very large scale-free networks, the problem of finding the largest quasi-clique becomes hard to manage with the existing approaches. Here, we propose a heuristic algorithm in this paper for locating the largest quasi-clique from the human protein-protein interaction networks. The results show promise in computational biology research by the exploration of significant protein modules. |
| Author | Bhattacharyya, Malay Bandyopadhyay, Sanghamitra |
| Author_xml | – sequence: 1 givenname: Sanghamitra surname: Bandyopadhyay fullname: Bandyopadhyay, Sanghamitra – sequence: 2 givenname: Malay surname: Bhattacharyya fullname: Bhattacharyya, Malay |
| BookMark | eNpN0L1OwzAUBWALFYlSujP6BRJ8_RMnEguqgFYKAiSYLce5LkGNU-xk4O1pBAN3OfcsZ_guySIMAQm5BpYDE-VNOEbMOQOea-AqhzOyBK2KjAmlF__-C7JO6ZOdTkutC74kt09d6MKejh9Iaxv3mEb6OtnUZe7QfU1Iu0C3U28DfYnDiKe2CyNG68ahxyty7u0h4fovV-T94f5ts83q58fd5q7OHEgGWVkIrzXzwNpGKGEbtJW3GisnUDrwEiy3lZS-LRuroWq54uga4RvVQqWVWBH2u-vikFJEb46x6238NsDMDGBmADMDmBnAgPgBnGVQ0A |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1038/npre.2012.7125.1 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) |
| EISSN | 1756-0357 |
| ExternalDocumentID | 10_1038_npre_2012_7125_1 |
| GroupedDBID | 123 AAYXX AKRSQ ALMA_UNASSIGNED_HOLDINGS CITATION FXI HH5 OK1 |
| ID | FETCH-LOGICAL-c1401-863f770f10db353abea9fa7e9c3e4c1f41a2a944fd8ba719d252ecb3fb5d19753 |
| ISSN | 1756-0357 |
| IngestDate | Tue Jul 01 04:27:58 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1401-863f770f10db353abea9fa7e9c3e4c1f41a2a944fd8ba719d252ecb3fb5d19753 |
| OpenAccessLink | http://dx.doi.org/10.1038/npre.2012.7125.1 |
| ParticipantIDs | crossref_primary_10_1038_npre_2012_7125_1 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012-04-03 |
| PublicationDateYYYYMMDD | 2012-04-03 |
| PublicationDate_xml | – month: 04 year: 2012 text: 2012-04-03 day: 03 |
| PublicationDecade | 2010 |
| PublicationTitle | Nature precedings |
| PublicationYear | 2012 |
| SSID | ssj0000747762 |
| Score | 1.7977523 |
| Snippet | A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module of vertices within a graph. However, in many real-world... |
| SourceID | crossref |
| SourceType | Index Database |
| Title | Mining the Largest Quasi-clique in Human Protein Interactome |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELZQuXBBlIKgPOQDB_aQZf1IvJG4IFRUobLisCv1Fo0dm12pTatuOCy_nhnHu0m3IFEuVmRZIytfMp4Zz3zD2DtX-iK3XmQioKej0VHOwKk6C6UK0pZO6TomyM6K04X-ep6f980UY3VJa8fu1x_rSv4HVZxDXKlK9h7I7oTiBD4jvjgiwjj-E8bfYneHaDueUUb3uqUkzfUqcxeRlpV4rGKQ_juxMaxS_I867NymKJhFdk_iC3DxLOtD59DUG3Sr6-UGuqQwaH4s4XLV3vSO_BLaFqh6a7OBrvznImXmpGgCpWXobKIGCtDkBU50pNFjf3fujsrtCNYb3CIlysmxQZNpLPrjZXulvnfq7HIB4y24mlYkoSIJFUmo0KN9KA3aQ1HZ5ru4GRH-m9gndretdPuMQj7sb2NgbQzMhvkT9jjZ-_xTB94he-Cbp-wwadQ1f59ov0dH7GOHJkc0eUKTD9Hkq4ZHNHlCkw_QfMYWX07mn0-z1Nsic-TSZtNCBWMmQUxqq3IF1kMZwHj8O7x2ImgBEkqtQz21YERZy1x6Z1WweS2oGPo5O2iuGv-CceJ49Eai_yGcLgGXOynAFTkIUUgdXrLR9h1U1x2FSfW3l358j7Wv2KP-C3rNDtqbn_4NWmitfRsh-w29vDpE |
| linkProvider | ABC ChemistRy |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Mining+the+Largest+Quasi-clique+in+Human+Protein+Interactome&rft.jtitle=Nature+precedings&rft.au=Bandyopadhyay%2C+Sanghamitra&rft.au=Bhattacharyya%2C+Malay&rft.date=2012-04-03&rft.issn=1756-0357&rft.eissn=1756-0357&rft_id=info:doi/10.1038%2Fnpre.2012.7125.1&rft.externalDBID=n%2Fa&rft.externalDocID=10_1038_npre_2012_7125_1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1756-0357&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1756-0357&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1756-0357&client=summon |