Results 111 to 120 of about 181,403 (139)

RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties. [PDF]

Bull Math Biol, 1999
Haslinger C, Stadler PF.
europepmc   +1 more source

Marker pair selection for mapping quantitative trait loci. [PDF]

Genetics, 2001
Piepho HP, Gauch HG.
europepmc   +1 more source

Anion inhibitor-sensitive unidirectional sodium movements in the human erythrocyte. [PDF]

J Gen Physiol, 1978
Callahan TJ, Goldstein DA.
europepmc   +1 more source

Families of Shape-Wilf-Equivalent Claw-Shaped Partially Ordered Patterns

Partially ordered patterns (POPs) generalize classical permutation patterns and have been extensively studied in the contexts of permutations, words, compositions, and partitions. Burstein, Han, Kitaev, and Zhang established the shape-Wilf-equivalence for individual claw-shaped POPs.
openaire   +2 more sources

Shape-Wilf-equivalence is not closed under inversion

We show that shape-Wilf-equivalence is not closed under inversion: of the seven inverse pairs of length-four patterns, exactly one is shape-Wilf-equivalent, and it is precisely the pair generated by the known equivalences of Backelin-West-Xin and Stankova-West. Since inverse patterns are always Wilf-equivalent and lifting commutes with inversion, every
openaire   +1 more source

The 4,755 Wilf-equivalence classes of permutations of length eight

Vatter's Question 3.1 asks how many Wilf-equivalence classes of length-eight permutations exist. Alex Dobner answered the question in a personal note posted in March 2026: there are exactly 4,755 classes. This deposit is an independent, fully audited confirmation and citable record: the paper (PDF) plus the complete machine-readable certificate archive
openaire   +1 more source

On Super-Strong Wilf Equivalence Classes of Permutations [PDF]

Electronic Journal of Combinatorics, 2018
Super-strong Wilf equivalence is a type of Wilf equivalence on words that was originally introduced as strong Wilf equivalence by Kitaev et al. [Electron. J. Combin. 16(2)] in $2009$. We provide a necessary and sufficient condition for two permutations in $n$ letters to be super-strongly Wilf equivalent, using distances between letters within a ...
Demetris Hadjiloucas, Ioannis Michos
exaly   +5 more sources