ロード中...
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...
保存先:
| 主要な著者: | , , , , , |
|---|---|
| フォーマット: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|