Rapid and robust antibody Fab fragment crystallization utilizing edge-to-edge beta-sheet packing
نویسندگان
چکیده
منابع مشابه
Sufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملEdge Disjoint Polyp Packing
A graph is called a p{polyp if it consists of p simple paths of the same length and one endvertex of all these paths is a common vertex. The Polyp Packing problem is a generalization of the well known Bin Packing problem: How to pack a set of paths with diierent lengths to a set of polyps edge disjointly? It is proved that the Polyp Packing problem is NP-complete and that a modiication of the F...
متن کاملPreparation, characterization and crystallization of an antibody Fab fragment that recognizes RNA. Crystal structures of native Fab and three Fab-mononucleotide complexes.
Fab fragments from Jel 103, an antibody which specifically binds to single-stranded poly(rl), were prepared by papain digestion, separated into eight isoforms and characterized by mass spectrometry. One of the purified isoforms yielded crystals suitable for structural studies by X-ray diffraction and its crystal structure was determined to 2.4 A resolution. Soaking the crystals in solutions con...
متن کاملCrystallization and preliminary X-ray diffraction analysis of prion protein bound to the Fab fragment of the POM1 antibody.
Prion diseases are neurodegenerative diseases that are characterized by the conversion of the cellular prion protein PrP(c) to the pathogenic isoform PrP(sc). Several antibodies are known to interact with the cellular prion protein and to inhibit this transition. An antibody Fab fragment, Fab POM1, was produced that recognizes a structural motif of the C-terminal domain of mouse prion protein. ...
متن کاملOn the Complexity of Edge Packing and Vertex Packing
This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by EDS ) and the vertex packing problem (denoted by DS ) are linear programming duals of the edge dominating set problem and the dominating set problem respectively. It is shown that these two problems are equivalent to the set packing problem with respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2020
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0232311