Near-optimal algorithm to count occurrences of subsequences of a given length.
Jose Torres-JimenezIdelfonso Izquierdo-MarquezDaniel Ramirez-AcunaRené PeraltaPublished in: Discret. Math. Algorithms Appl. (2017)
Keyphrases
- times faster
- detection algorithm
- cost function
- learning algorithm
- computational complexity
- experimental evaluation
- preprocessing
- significant improvement
- improved algorithm
- dynamic programming
- optimization algorithm
- np hard
- estimation algorithm
- computationally efficient
- classification algorithm
- tree structure
- hardware implementation
- clustering method
- total length
- data structure
- theoretical analysis
- expectation maximization
- simulated annealing
- matching algorithm
- path planning
- high accuracy
- memory requirements
- convergence rate
- computational cost
- objective function
- reinforcement learning