新刻京本全像插增田虎王慶忠義水滸全傳Xin ke jing ben quan xiang cha zeng tian hu wang qing zhong yi shui hu quan zhuan.Le Shui hu zhuan, etc., édition complétée et illustrée, nouvellement gravée à la capitale.

Vieille édition avec illustrations en haut des pages.Livre 20 et début du livre 21 (hui 99 à 102).

水滸傳Shui hu zhuan.Le Shui hu zhuan.

Manuscrit en Chinois (XVIIe siècle), avec prononciation de quelques caractères mise en lettres latines à la plume ; deux fragments.

水滸傳Shui hu zhuan.Le Shui hu zhuan.

Manuscrit en Chinois (XVIIe siècle), avec prononciation de quelques caractères mise en lettres latines à la plume ; deux fragments.

新增第五才子書. 水滸全傳Xin zeng di wu cai zi shu — Shui hu quan zhuan. Autre titre : 征四寇傳Zheng si kou zhuan.Le Shui hu zhuan, édition nouvelle.

Suite du roman, avec préface par Ru lian (1736) ; gravé à la salle Zhen xian.Livres 1 à 10 (hui 67 à 115).

Jie Shui hu zhuan : 70 juan juan mo /

Mode of access: Internet.

Hyōron shutsuzō Suikoden /

Title on flying leave: Seitan gaisho Suikoden.

Tsūzoku chūgi suikoden.

Cover title: Hui pen chung i shui hu chuan.

Hu hai wen zhuan : 75 juan /

On double leaves, oriental style, in 2 cases.

Hu hai shi zhuan xiao zhuan

Mode of access: Internet.

新鐫批評秘本玉支磯小傳Xin juan pi ping bi ben yu zhi ji xiao zhuan.Histoire du rocher aux veines de jade.

Par Yin shui shan ren et par l'homme du Tian hua zang. Édition du pavillon Zui hua.20 hui.

Bai hu wen gao : 8 juan, shi gao : 8 juan /

v. 3 fu: Bai hu Ye jun mu zhi ming / Qin Ying zhuan.

Fang wai bie zhuan : 3 juan /

[Beijing] Li cheng tang cun ban.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

DNA Clasping by Mycobacterial HU: The C-Terminal Region of HupB Mediates Increased Specificity of DNA Binding

Background: HU a small, basic, histone like protein is a major component of the bacterial nucleoid. E. coli has two subunits of HU coded by hupA and hupB genes whereas Mycobacterium tuberculosis (Mtb) has only one subunit of HU coded by ORF Rv2986c (hupB gene). One noticeable feature regarding Mtb HupB, based on sequence alignment of HU orthologs from different bacteria, was that HupB(Mtb) bears at its C-terminal end, a highly basic extension and this prompted an examination of its role in Mtb HupB function. Methodology/Principal Findings: With this objective two clones of Mtb HupB were generated; one expressing full length HupB protein (HupB(Mtb)) and another which expresses only the N terminal region (first 95 amino acid) of hupB (HupB(MtbN)). Gel retardation assays revealed that HupBMtbN is almost like E. coli HU (heat stable nucleoid protein) in terms of its DNA binding, with a binding constant (K-d) for linear dsDNA greater than 1000 nM, a value comparable to that obtained for the HU alpha alpha and HU alpha beta forms. However CTR (C-terminal Region) of HupB(Mtb) imparts greater specificity in DNA binding. HupB(Mtb) protein binds more strongly to supercoiled plasmid DNA than to linear DNA, also this binding is very stable as it provides DNase I protection even up to 5 minutes. Similar results were obtained when the abilities of both proteins to mediate protection against DNA strand cleavage by hydroxyl radicals generated by the Fenton's reaction, were compared. It was also observed that both the proteins have DNA binding preference for A: T rich DNA which may occur at the regulatory regions of ORFs and the oriC region of Mtb. Conclusions/Significance: These data thus point that HupB(Mtb) may participate in chromosome organization in-vivo, it may also play a passive, possibly an architectural role.