An inexact-suffix-tree-based algorithm for detecting extensible patterns.
Abhijit ChattarajLaxmi ParidaPublished in: Theor. Comput. Sci. (2005)
Keyphrases
- experimental evaluation
- detection algorithm
- computational cost
- preprocessing
- computational complexity
- objective function
- dynamic programming
- improved algorithm
- matching algorithm
- optimal solution
- search space
- classification algorithm
- expectation maximization
- computationally efficient
- theoretical analysis
- optimization algorithm
- learning algorithm
- suffix tree
- times faster
- probabilistic model
- simulated annealing
- rough sets
- recognition algorithm
- selection algorithm
- similarity measure
- neural network