Finite automata based algorithms on subsequences and supersequences of degenerate strings.
Costas S. IliopoulosM. Sohel RahmanMichal VorácekLadislav VagnerPublished in: J. Discrete Algorithms (2010)
Keyphrases
- theoretical analysis
- longest common subsequence
- recently developed
- learning algorithm
- significant improvement
- optimization problems
- real time
- computationally expensive
- times faster
- databases
- finite automata
- data sets
- data mining
- computational cost
- worst case
- classification algorithm
- combinatorial optimization
- variable length