ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies

标题
ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies
作者
关键词
Independent motif counting, Probabilistic networks, Polynomial
出版物
BMC BIOINFORMATICS
Volume 19, Issue 1, Pages -
出版商
Springer Nature
发表日期
2018-06-26
DOI
10.1186/s12859-018-2236-9

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started