• Dom
  • longest common substring problem

longest common substring problem

problem of finding the longest string that is a substring of two or more strings

en-GB/ˈlɒŋɡɪst ˈkɒmən sʌbstɹɪŋ ˈpɹɒbləm/

Kategorie:

computational problem