We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...