Longest Common Substring Problem - Problem Definition

Problem Definition

Given two strings, of length and of length, find the longest strings which are substrings of both and .

A generalisation is the k-common substring problem. Given the set of strings, where and Σ. Find for each 2 ≤ ≤, the longest strings which occur as substrings of at least strings.

Read more about this topic:  Longest Common Substring Problem

Famous quotes containing the words problem and/or definition:

    If we parents accept that problems are an essential part of life’s challenges, rather than reacting to every problem as if something has gone wrong with universe that’s supposed to be perfect, we can demonstrate serenity and confidence in problem solving for our kids....By telling them that we know they have a problem and we know they can solve it, we can pass on a realistic attitude as well as empower our children with self-confidence and a sense of their own worth.
    Barbara Coloroso (20th century)

    ... we all know the wag’s definition of a philanthropist: a man whose charity increases directly as the square of the distance.
    George Eliot [Mary Ann (or Marian)