Algorithms for Computing the Longest Parameterized Common Subsequence.
Costas S. IliopoulosMarcin KubicaM. Sohel RahmanTomasz WalenPublished in: CPM (2007)
Keyphrases
- orders of magnitude
- recently developed
- combinatorial optimization
- times faster
- theoretical analysis
- data structure
- upper bound
- data sets
- computationally efficient
- worst case
- efficient algorithms for computing
- benchmark datasets
- machine learning algorithms
- optimization problems
- simulated annealing
- computational cost
- significant improvement
- computational complexity
- optimal solution
- image processing
- learning algorithm
- neural network
- databases