טוען...

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgr...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
Main Authors: Demeyer, Sofie, Michoel, Tom, Fostier, Jan, Audenaert, Pieter, Pickavet, Mario, Demeester, Piet
פורמט: Artigo
שפה:Inglês
יצא לאור: Public Library of Science 2013
נושאים:
גישה מקוונת:https://ncbi.nlm.nih.gov/pmc/articles/PMC3631255/
https://ncbi.nlm.nih.gov/pubmed/23620730
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0061183
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!