Login / Signup

The shortest common superstring problem: Average case analysis for both exact and approximate matching.

En-Hui YangZhen Zhang
Published in: IEEE Trans. Inf. Theory (1999)
Keyphrases
  • average case
  • exact and approximate
  • dynamic programming
  • worst case
  • decision trees
  • object recognition
  • high dimensional
  • pattern matching
  • matching algorithm
  • graph matching
  • uniform distribution