IDEAS home Printed from https://ideas.repec.org/a/hin/complx/2132516.html
   My bibliography  Save this article

PPI-GA: A Novel Clustering Algorithm to Identify Protein Complexes within Protein-Protein Interaction Networks Using Genetic Algorithm

Author

Listed:
  • Naeem Shirmohammady
  • Habib Izadkhah
  • Ayaz Isazadeh
  • Mojtaba Ahmadieh Khanesar

Abstract

Comprehensive analysis of proteins to evaluate their genetic diversity, study their differences, and respond to the tensions is the main subject of an interdisciplinary field of study called proteomics. The main objective of the proteomics is to detect and quantify proteins and study their post-translational modifications and interactions using protein chemistry, bioinformatics, and biology. Any disturbance in proteins interactive network can act as a source for biological disorders and various diseases such as Alzheimer and cancer. Most current computational methods for discovering protein complexes are usually based on specific topological characteristics of protein-protein networks (PPI). To identify the protein complexes, in this paper, we, first, present a new encoding method to represent solutions; we then propose a new clustering algorithm based on the genetic algorithm, named PPI-GA, employing a new multiobjective quality function. The proposed algorithm is evaluated on two gold standard and real-world datasets. The result achieved demonstrates that the proposed algorithm can detect important protein complexes, and it provides more accurate results compared with state-of-the-art protein complex identification algorithms.

Suggested Citation

  • Naeem Shirmohammady & Habib Izadkhah & Ayaz Isazadeh & Mojtaba Ahmadieh Khanesar, 2021. "PPI-GA: A Novel Clustering Algorithm to Identify Protein Complexes within Protein-Protein Interaction Networks Using Genetic Algorithm," Complexity, Hindawi, vol. 2021, pages 1-14, March.
  • Handle: RePEc:hin:complx:2132516
    DOI: 10.1155/2021/2132516
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/2132516.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/2132516.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/2132516?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:2132516. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.