טוען...
ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies
BACKGROUND: Identifying motifs in biological networks is essential in uncovering key functions served by these networks. Finding non-overlapping motif instances is however a computationally challenging task. The fact that biological interactions are uncertain events further complicates the problem,...
שמור ב:
| הוצא לאור ב: | BMC Bioinformatics |
|---|---|
| Main Authors: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
BioMed Central
2018
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6020255/ https://ncbi.nlm.nih.gov/pubmed/29940838 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s12859-018-2236-9 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|