Results 1  10
of
11
Palindromic Permutations and Generalized Smarandache Palindromic Permutations ∗†
, 2006
"... The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups Sn of degree n. It is shown that in Sn, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S2 an ..."
Abstract
 Add to MetaCart
The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups Sn of degree n. It is shown that in Sn, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S2
Systolic Arrays for the Recognition of PermutationInvariant Segments
"... Let P be a permutation defined on sequences of length N . A sequence of N values is said to be P invariant when it does not change when permuted according to P . A program is said to recognize P  invariant segments when it determines for each segment of N successive input values whether it is P i ..."
Abstract
 Add to MetaCart
Let P be a permutation defined on sequences of length N . A sequence of N values is said to be P invariant when it does not change when permuted according to P . A program is said to recognize P  invariant segments when it determines for each segment of N successive input values whether it is P
Enumerating segmented patterns in compositions and encoding with restricted permutations, available at http://arxiv.org/abs/math.CO/0505094
"... A composition of a nonnegative integer n is a sequence of positive integers whose sum is n. A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of occurrences of arbitrary segmented partially ordered patterns among ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
A composition of a nonnegative integer n is a sequence of positive integers whose sum is n. A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of occurrences of arbitrary segmented partially ordered patterns
Science of Computer Programming
, 1993
"... Let P be a permutation defined on sequences of length N. A sequence of N values is said to be Pinvariant when it does not change when permuted according to P. A program is said to recognize Pinvariant segments when it determines for each segment of N successive input values whether it is Pinvaria ..."
Abstract
 Add to MetaCart
Let P be a permutation defined on sequences of length N. A sequence of N values is said to be Pinvariant when it does not change when permuted according to P. A program is said to recognize Pinvariant segments when it determines for each segment of N successive input values whether it is P
On an involution of Christoffel words and Sturmian morphisms
 European Journal of Combinatorics
"... There is a natural involution on Christoffel words, originally studied by the second author in [dL2]. We show that it has several equivalent definitions: one of them uses the slope of the word, and changes the numerator and the denominator respectively in their inverses modulo the length; another on ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
one uses the cyclic graph allowing the construction of the word, by interpreting it in two ways (one as a permutation and its ascents and descents, coded by the two letters of the word, the other in the setting of the Fine and Wilf periodicity theorem); a third one uses central words and generation
Maximal continuants and the FineWilf theorem
 J. Combin. Theory Ser. A
"... Abstract. The following problem was posed by C.A. Nicol: given any finite sequence of positive integers, find the permutation for which the continuant (i.e. the continued fraction denominator) having these entries is maximal, resp. minimal. The extremal arrangements are known for the regular continu ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The following problem was posed by C.A. Nicol: given any finite sequence of positive integers, find the permutation for which the continuant (i.e. the continued fraction denominator) having these entries is maximal, resp. minimal. The extremal arrangements are known for the regular
Tackling the Minimal Superpermutation Problem
, 2014
"... A superpermutation on n symbols is a string that contains each of the n! permutations of the n symbols as a contiguous substring. The shortest superpermutation on n symbols was conjectured to have length ∑n i=1 i!. The conjecture had been verified for n ≤ 5. We disprove it by exhibiting an explicit ..."
Abstract
 Add to MetaCart
A superpermutation on n symbols is a string that contains each of the n! permutations of the n symbols as a contiguous substring. The shortest superpermutation on n symbols was conjectured to have length ∑n i=1 i!. The conjecture had been verified for n ≤ 5. We disprove it by exhibiting an explicit
TGAl and GBox Binding Factors: Two Distinct Classes of Arabidopsis Leucine Zipper Proteins Compete for the GBoxLike Element TGACGTGG
"... Regulatory elements containing the sequence ACGT are found in several plant promoters and are recognized by various basiclleucine zipper (bZIP) proteins. The Arabidopsis Gbox binding factor 1 (GBFl), initially identified by its ability to bind to the palindromic Gbox (CCACGTGG), also interacts wit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Regulatory elements containing the sequence ACGT are found in several plant promoters and are recognized by various basiclleucine zipper (bZIP) proteins. The Arabidopsis Gbox binding factor 1 (GBFl), initially identified by its ability to bind to the palindromic Gbox (CCACGTGG), also interacts
Staphylococcus epidermidis Csm1 is a 30–50 exonuclease
, 2013
"... Clustered Regularly Interspaced Short Palindromic Repeats (CRISPR) offer an adaptive immune system that protects bacteria and archaea from nucleic acid invaders through an RNAmediated nucleic acid cleavage mechanism. Our knowledge of nucleic acid cleavage mechanisms is limited to three examples of ..."
Abstract
 Add to MetaCart
Clustered Regularly Interspaced Short Palindromic Repeats (CRISPR) offer an adaptive immune system that protects bacteria and archaea from nucleic acid invaders through an RNAmediated nucleic acid cleavage mechanism. Our knowledge of nucleic acid cleavage mechanisms is limited to three examples
The protelomerase of the phageplasmid N15 is responsible for its maintenance in linear
, 2001
"... The prophage of coliphage N15 is not integrated into the bacterial chromosome but exists as a linear plasmid molecule with covalently closed ends. Upon infection of an Escherichia coli cell, the phage DNA circularises via cohesive ends. A phageencoded enzyme, protelomerase, then cuts at another si ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
family, 3 although its prophage is not integrated into the bacterial chromosome. 6,7 N15 phage DNA is a linear molecule with 12 nt cohesive ends. 8 Physical mapping of phage and prophage DNA showed that the two maps are circularly permuted (for a review see 9 ). This suggests the following mechanism
Results 1  10
of
11