IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0068073.html
   My bibliography  Save this article

QuateXelero: An Accelerated Exact Network Motif Detection Algorithm

Author

Listed:
  • Sahand Khakabimamaghani
  • Iman Sharafuddin
  • Norbert Dichter
  • Ina Koch
  • Ali Masoudi-Nejad

Abstract

Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks’ structure and function. However, this task is very computationally demanding, because it is highly associated with the graph isomorphism which is an NP problem (not known to belong to P or NP-complete subsets yet). Accordingly, this research is endeavoring to decrease the need to call NAUTY isomorphism detection method, which is the most time-consuming step in many existing algorithms. The work provides an extremely fast motif detection algorithm called QuateXelero, which has a Quaternary Tree data structure in the heart. The proposed algorithm is based on the well-known ESU (FANMOD) motif detection algorithm. The results of experiments on some standard model networks approve the overal superiority of the proposed algorithm, namely QuateXelero, compared with two of the fastest existing algorithms, G-Tries and Kavosh. QuateXelero is especially fastest in constructing the central data structure of the algorithm from scratch based on the input network.

Suggested Citation

  • Sahand Khakabimamaghani & Iman Sharafuddin & Norbert Dichter & Ina Koch & Ali Masoudi-Nejad, 2013. "QuateXelero: An Accelerated Exact Network Motif Detection Algorithm," PLOS ONE, Public Library of Science, vol. 8(7), pages 1-15, July.
    • Handle: RePEc:plo:pone00:0068073
    DOI: 10.1371/journal.pone.0068073
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0068073
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0068073&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0068073?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Luo, Jiawei & Li, Guanghui & Song, Dan & Liang, Cheng, 2014. "CombiMotif: A new algorithm for network motifs discovery in protein–protein interaction networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 309-320.
    2. Feng, Pihu & Lu, Xin & Gong, Zaiwu & Sun, Duoyong, 2021. "A case study of the pyramid scheme in China based on communication network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    3. Marius Agasse-Duval & Steve Lawford, 2019. "Subgraphs and Motifs in a Dynamic Airline Network," Working Papers hal-02017122, HAL.

    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:plo:pone00:0068073. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.