151 search results - page 4 / 31 » Longest Common Pattern between two Permutations |
DM
2007
13 years 7 months ago
2007
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...
JCT
2010
13 years 5 months ago
2010
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
SPIRE
2010
Springer
13 years 5 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...