Login / Signup
A uniform random graph model for directed acyclic networks and its effect on motif-finding.
C. J. Carstens
Published in:
J. Complex Networks (2014)
Keyphrases
</>
graph model
directed acyclic
graph structure
motif finding
uniform random
biological sequences
bipartite graph
graphical models
memetic algorithm
weighted graph
databases
clustering method
motif discovery
language model
similarity measure
social networks
network structure
suffix tree