Results 291 to 300 of about 407,922 (313)
Cannabis Laws and Opioid Use Among Commercially Insured Patients With Cancer Diagnoses.
JAMA Health ForumLozano-Rojas F +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACS Synthetic Biology, 2016
We define a new inversion-based machine called a permuton of n genetic elements, which allows the n elements to be rearranged in any of the n·(n - 1)·(n - 2)···2 = n! distinct orderings. We present two design algorithms for architecting such a machine.
Swapnil, Bhatia +4 more
openaire +2 more sources
We define a new inversion-based machine called a permuton of n genetic elements, which allows the n elements to be rearranged in any of the n·(n - 1)·(n - 2)···2 = n! distinct orderings. We present two design algorithms for architecting such a machine.
Swapnil, Bhatia +4 more
openaire +2 more sources
Journal of the London Mathematical Society, 1991
The group \(\hbox{Sym }\mathbb{R}\) of permutations of the set \(\mathbb{R}\) of real numbers is considered in the paper. Let \(P_ 0\) be its subgroup of power functions \(x\mapsto x^{m/n}\) where \(m\), \(n\) are positive odd integers, \(T\) be the subgroup of translations \(x\mapsto x+a\) where \(a\) is a real algebraic number, and \(M\) be the ...
Adeleke, S. A. +2 more
openaire +2 more sources
The group \(\hbox{Sym }\mathbb{R}\) of permutations of the set \(\mathbb{R}\) of real numbers is considered in the paper. Let \(P_ 0\) be its subgroup of power functions \(x\mapsto x^{m/n}\) where \(m\), \(n\) are positive odd integers, \(T\) be the subgroup of translations \(x\mapsto x+a\) where \(a\) is a real algebraic number, and \(M\) be the ...
Adeleke, S. A. +2 more
openaire +2 more sources
Results in Mathematics, 2011
The paper is concerned with so called geometric permutations. It starts by showing the connection between permutations and Coxeter-Bennet configurations (CBC's are regular graphs on \(d+3\) vertices having degree \(d\)). This connection is used to define an equivalence relation on permutations. Next some properties of difference permutations (roughly \(
openaire +2 more sources
The paper is concerned with so called geometric permutations. It starts by showing the connection between permutations and Coxeter-Bennet configurations (CBC's are regular graphs on \(d+3\) vertices having degree \(d\)). This connection is used to define an equivalence relation on permutations. Next some properties of difference permutations (roughly \(
openaire +2 more sources
Communications of the ACM, 1976
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire +2 more sources
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire +2 more sources
Array Permutation by Index-Digit Permutation
Journal of the ACM, 1976An array may be reordered according to a common permutation of the digits of each of its element indices. The digit-reversed reordering which results from common fast Fourier transform (FFT) algorithms is an example. By examination of this class of permutation in detail, very efficient algorithms for transforming very long arrays are developed.
openaire +1 more source