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:

    What had really caused the women’s movement was the additional years of human life. At the turn of the century women’s life expectancy was forty-six; now it was nearly eighty. Our groping sense that we couldn’t live all those years in terms of motherhood alone was “the problem that had no name.” Realizing that it was not some freakish personal fault but our common problem as women had enabled us to take the first steps to change our lives.
    Betty Friedan (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)