Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems.
Laurentius LeonardKen TanakaPublished in: CoRR (2022)
Keyphrases
- optimization problems
- difficult problems
- data structure
- hard problems
- suffix tree
- test problems
- approximate solutions
- practical problems
- learning algorithm
- computationally efficient
- exact algorithms
- related problems
- computationally hard
- greedy algorithms
- computational problems
- theoretical guarantees
- significant improvement
- heuristic methods
- benchmark problems
- combinatorial optimization
- theoretical analysis
- np complete
- evolutionary algorithm
- search problems
- association rules
- partial solutions
- metaheuristic
- problems in computer vision
- query processing
- nearest neighbor
- computational complexity
- computational cost