Find the shortest continuous subsequence of words

public  bool ContainsSubequence<t>(this IEnumerable<t>parent, IEnumerable<t>target)
   {
       bool foundOneMatch = false;
       var enumeratedTarget = target.ToList();
       int enumPos = 0;

       using (IEnumerator<t>parentEnum = parent.GetEnumerator())
       {
           while (parentEnum.MoveNext())
           {
               if (enumeratedTarget[enumPos].Equals(parentEnum.Current))
               {
                   // Match, so move the target enum forward
                   foundOneMatch = true;
                   if (enumPos == enumeratedTarget.Count - 1)
                   {
                       // We went through the entire target, so we have a match
                       return true;
                   }

                   enumPos++;
               }
               else if (foundOneMatch)
               {
                   foundOneMatch = false;
                   enumPos = 0;

                   if (enumeratedTarget[enumPos].Equals(parentEnum.Current))
                   {
                       foundOneMatch = true;
                       enumPos++;
                   }
               }
           }

           return false;
       }
   }