The best algorithm for finding a repeating pattern

Question

What are the best algorithms available for finding the longest repeating character patterns in a string using .net?

Answer 1

I assume you are talking about pattern detection. Take a look at some elementary aproach ( source )

private static Dictionary<string, int> FindPatterns(string value) {
  List<string> patternToSearchList = new List<string>();
  for (int i = 0; i < value.Length; i++) {
    for (int j = 2; j <= value.Length / 2; j++) {
      if (i + j <= value.Length) {
        patternToSearchList.Add(value.Substring(i, j));
      }
    }
  }
  // pattern matching
  Dictionary<string, int> results = new Dictionary<string, int>();
  foreach (string pattern in patternToSearchList) {
    int occurence = Regex.Matches(value, pattern, RegexOptions.IgnoreCase).Count;
    if (occurence > 1) {
      results[pattern] = occurence;
    }
  }

  return results;
}

static void Main(string[] args) {
  Dictionary<string, int> result = FindPatterns("asdxgkeopgkajdflkjbpoijadadafhjkafikeoadkjhadfkjhocihakeo");
  foreach (KeyValuePair<string, int> res in result.OrderByDescending(r => r.Value)) {
    Console.WriteLine("Pattern:" + res.Key + " occurence:" + res.Value.ToString());
  }
  Console.Read();
}

The algorithm consists of two stages.

• Choose a template
• Find a pattern in the input line (Pattern matching algorithm)

Regex . . http://www-igm.univ-mlv.fr/~lecroq/string/ , C. Boyer-Moore , #

Answer 2

:

For N=1 to InputString.Length-1
  rotatedString = RotateStringByN(InputString,N)
  For N=0 to InputString.Length-1
     StringResult[N] = if (rotatedString[N]==InputString[N]) then
                            InputString[N]  
                       else 
                            Convert.ToChar(0x0).ToString()
  RepeatedStrings[] = String.Split(StringResult, Convert.ToChar(0x0).ToString())
  SaveLongestStringFrom(RepeatedStrings)

... SO .