A polynomial-time algorithm for computing characteristic strings under a set of strings.
Minoru ItoKuniyasu ShimizuMichio NakanishiAkihiro HashimotoPublished in: Systems and Computers in Japan (1995)
Keyphrases
- computational complexity
- string matching
- particle swarm optimization
- dynamic programming
- learning algorithm
- preprocessing
- initial set
- input data
- closest string
- boolean expressions
- solution space
- worst case
- special case
- alphabet size
- genetic algorithm
- optimal solution
- np hard
- lower bound
- suffix array
- search space
- polynomial time complexity
- image segmentation
- finite state automata
- decomposition algorithm
- k means
- matching algorithm
- tree structure
- detection algorithm
- multi objective
- probabilistic model