Estimating Propensity Parameters using Google PageRank and Genetic Algorithms
Stochastic Boolean networks, or more generally, stochastic discrete networks, are an important class of computational models for molecular interaction networks. The stochasticity stems from the updating schedule. Standard updating schedules include the synchronous update, where all the nodes are upd...
Main Authors: | David Murrugarra, Jacob Miller, Alex Mueller |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2016-11-01
|
Series: | Frontiers in Neuroscience |
Subjects: | |
Online Access: | http://journal.frontiersin.org/Journal/10.3389/fnins.2016.00513/full |
Similar Items
-
Efficient algorithm to compute Markov transitional probabilities for a desired PageRank
by: Gábor Berend
Published: (2020-07-01) -
Combining the Two-Layers PageRank Approach with the APA Centrality in Networks with Data
by: Taras Agryzkov, et al.
Published: (2018-12-01) -
Toward Efficient Hub-Less Real Time Personalized PageRank
by: Matin Pirouz, et al.
Published: (2017-01-01) -
Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach
by: Taras Agryzkov, et al.
Published: (2019-02-01) -
Distributed Algorithms on Exact Personalized PageRank
by: Guo, Tao, et al.
Published: (2017)