An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem.
Daniel S. HirschbergPublished in: Inf. Process. Lett. (1978)
Keyphrases
- information theoretic
- lower bound
- beam search
- branch and bound
- upper bound
- mutual information
- information theory
- theoretic framework
- information bottleneck
- log likelihood
- information theoretic measures
- jensen shannon divergence
- objective function
- optimal solution
- search algorithm
- worst case
- minimum description length
- heuristic search
- np hard
- entropy measure
- search methods
- search strategies
- kl divergence
- relative entropy
- search problems
- distributional clustering
- information retrieval
- evolutionary algorithm
- multi modality
- sample complexity