Login / Signup

Bounding the Expected Length of Longest Common Subsequences and Forests.

Ricardo A. Baeza-YatesRicard GavaldàGonzalo NavarroRodrigo Scheihing
Published in: Theory Comput. Syst. (1999)
Keyphrases
  • upper bound
  • random forests
  • variable length
  • longest common subsequence
  • knowledge base
  • data streams
  • special case
  • fixed length
  • total length
  • finite alphabet