An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences.
Jean-Jacques HébrardPublished in: Theor. Comput. Sci. (1991)
Keyphrases
- cost function
- detection algorithm
- objective function
- high accuracy
- optimization algorithm
- computational complexity
- improved algorithm
- k means
- worst case
- dynamic programming
- decision trees
- theoretical analysis
- computational cost
- experimental evaluation
- data sets
- matching algorithm
- convex hull
- recognition algorithm
- tree structure
- highly efficient
- bit strings
- particle swarm optimization
- simulated annealing
- scheduling problem
- np hard
- hidden markov models
- search space
- similarity measure
- database systems