An improved voting algorithm for planted (l, d) motif search.
Yun XuJiaoyun YangYuZhong ZhaoYi ShangPublished in: Inf. Sci. (2013)
Keyphrases
- preprocessing
- improved algorithm
- computational cost
- learning algorithm
- experimental evaluation
- significant improvement
- dynamic programming
- theoretical analysis
- detection algorithm
- experimental study
- computationally efficient
- k means
- path planning
- times faster
- segmentation algorithm
- convergence rate
- single pass
- high accuracy
- worst case
- search space
- computational complexity
- optimal solution
- expectation maximization
- semi supervised
- np hard
- tree structure
- matching algorithm
- data structure
- estimation algorithm
- clustering algorithm