Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time.
Amartya Shankha BiswasTalya EdenRonitt RubinfeldPublished in: APPROX-RANDOM (2021)
Keyphrases
- optimal solution
- dynamic programming
- learning algorithm
- computational cost
- monte carlo
- high accuracy
- optimization algorithm
- convergence rate
- matching algorithm
- tree structure
- expectation maximization
- particle swarm optimization
- experimental evaluation
- objective function
- computational complexity
- search space
- cost function
- worst case
- np hard
- sampling algorithm
- decomposition algorithm
- motif finding
- neural network
- detection algorithm
- k means
- path planning
- random sampling
- globally optimal
- optimal strategy
- optimal parameters
- motif discovery
- locally optimal