Home >  Term: heaviest common subsequence
heaviest common subsequence

The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.

0 0

Creator

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.