Sign in

A New Algorithm for Counting Independent Motifs in Probabilistic Networks.

Aisharjya SarkarYuanfang RenRasha ElheshaTamer Kahveci
Published in: IEEE ACM Trans. Comput. Biol. Bioinform. (2019)
Keyphrases
  • learning algorithm
  • computational complexity
  • optimal solution
  • objective function
  • np hard
  • k means
  • dynamic programming
  • graphical models
  • computationally efficient
  • convex hull
  • expectation maximization
  • incomplete data