✦ LIBER ✦

Circular permutations by number of rises and successions

✍ Scribed by Wayne M. Dymacek; D.P. Roselle

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 254 KB
Volume: 25
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90083-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Major Index and Inversion Number of Perm

Major Index and Inversion Number of Permutations

✍ Dominique Foata; Marcel-Paul Schützenberger 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 800 KB

Rational Modification of Ligand-Binding

Rational Modification of Ligand-Binding Preference of Avidin by Circular Permutation and Mutagenesis

✍ Juha A. E. Määttä; Tomi T. Airenne; Henri R. Nordlund; Janne Jänis; Tiina A. Pal 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

Rational Modification of Ligand-Binding

Rational Modification of Ligand-Binding Preference of Avidin by Circular Permutation and Mutagenesis

✍ Juha A. E. Määttä; Tomi T. Airenne; Henri R. Nordlund; Janne Jänis; Tiina A. Pal 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 986 KB

## Abstract Chicken avidin is a key component used in a wide variety of biotechnological applications. Here we present a circularly permuted avidin (cpAvd4→3) that lacks the loop between β‐strands 3 and 4. Importantly, the deletion of the loop has a positive effect on the binding of 4′‐hydroxyazobe

The number of labeled graphs placeable b

The number of labeled graphs placeable by a given permutation

✍ Hasunuma, Toru; Shibata, Yukio 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB 👁 2 views

Let S be a finite set and u a permutation on S. The permutation u\* on the set of 2-subsets of S is naturally induced by u. Suppose G is a graph and V(G), €(G) are the vertex set, the edge set, respectively. Let V(G) = S. If €(G) and u\*(€(G)), the image of €(G) by u\*, have no common element, then

Circular chromatic number of subgraphs

✍ Hossein Hajiabolhassan; Xuding Zhu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract This paper proves that every (__n__ + )‐chromatic graph contains a subgraph __H__ with $\chi \_c (H) = n$. This provides an easy method for constructing sparse graphs __G__ with $\chi\_c (G) = \chi ( G) = n$. It is also proved that for any ε > 0, for any fraction __k/d__ > 2, there exis

Circular Chromatic Numbers and Fractiona

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

✍ G.J. Chang; L. Huang; X. Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for