Large-scale albuminuria screen for nephropathy models in chemically induced mouse mutants

Background/Aim: Phenotype-driven screening of a great pool of randomly mutant mice and subsequent selection of animals showing symptoms equivalent to human kidney diseases may result in the generation of novel suitable models for the study of the pathomechanisms and the identification of genes involved in kidney dysfunction. Methods: We carried out a large-scale analysis of ethylnitrosourea (ENU)-induced mouse mutants for albuminuria by using qualitative SDS-polyacrylamide gel electrophoresis. Results: The primary albuminuria screen preceded the comprehensive phenotypic mutation analysis in a part of the mice of the Munich ENU project to avoid loss of mutant animals as a consequence of prolonged suffering from severe nephropathy. The primary screen detected six confirmed phenotypic variants in 2,011 G1 animals screened for dominant mutations and no variant in 48 G3 pedigrees screened for recessive mutations. Further breeding experiments resulted in two lines showing a low phenotypic penetrance of albuminuria. The secondary albuminuria screen was carried out in mutant lines which were established in the Munich ENU project without preceding primary albuminuria analysis. Two lines showing increased plasma urea levels were chosen to clarify if severe kidney lesions are involved in the abnormal phenotype. This analysis revealed severe albuminuria in mice which are affected by a recessive mutation leading to increased plasma urea and cholesterol levels. Conclusion: Thus, the phenotypic selection of ENU-induced mutants according to the parameter proteinuria in principle demonstrates the feasibility to identify nephropathy phenotypes in ENU-mutagenized mice. Copyright (C) 2005 S. Karger AG, Basel

Minimum and maximum against k lies

A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for pairwise comparisons. More recently, the problem has been studied in the context of the Renyi-Ulam liar games, where the oracle may give up to k false answers. For large k, an upper bound due to Aigner shows that (k+O(\sqrt{k}))n comparisons suffice. We improve on this by providing an algorithm with at most (k+1+C)n+O(k^3) comparisons for some constant C. The known lower bounds are of the form (k+1+c_k)n-D, for some constant D, where c_0=0.5, c_1=23/32=0.71875, and c_k=\Omega(2^{-5k/4}) as k goes to infinity.Comment: 11 pages, 3 figure

Biofabrication using recombinant spider silk proteins as a biomaterial

Biofabrication for applications in regenerative medicine is a rapidly expanding field. Remarkable about this approach compared to traditional approaches is its feasibility for larger scale production at high quality and reproducibility. However, there is a lack of process-compatible materials for biofabrication due to the need for mild, aqueous processing conditions. More specifically, the solvents used must have neutral pH, and salts in proper osmolality, temperatures used cannot be too high or low, and so forth. The recombinant spider-silk protein eADF4(C16) (engineered Araneus diadematus fibroin 4) is biocompatible, biodegradable and hypoallergenic and can be provided in large quantities with consistent material qualities. In order to overcome limitations in terms of cell adhesion and proliferation e.g. the integrin recognition sequence RGD was genetically introduced. eADF4(C16) and its variants can be fabricated into various types of scaffold. Morphologies produced from recombinant spider silk proteins include films, foams, fibers, particles, microcapsules and hydrogels. However, with the exception of thermally-gelled hydrogels, the established processes are not cytocompatible due to extreme physical (e.g. high voltages, high salt concentration) and/or chemical (e.g. toxic solvents) conditions. Thereby, current research with these recombinant proteins focuses on utilizing thermally-gelled hydrogel as bioinks to be used in biofabrication and optimizing current processing protocols for other morphologies to be cell-friendly

Imaging geometry through dynamics: the observable representation

For many stochastic processes there is an underlying coordinate space, $V$, with the process moving from point to point in $V$ or on variables (such as spin configurations) defined with respect to $V$. There is a matrix of transition probabilities (whether between points in $V$ or between variables defined on $V$) and we focus on its ``slow'' eigenvectors, those with eigenvalues closest to that of the stationary eigenvector. These eigenvectors are the ``observables,'' and they can be used to recover geometrical features of $V$

Disorder Potentials near Lithographically Fabricated Atom Chips

We show that previously observed large disorder potentials in magnetic microtraps for neutral atoms are reduced by about two orders of magnitude when using atom chips with lithographically fabricated high quality gold layers. Using one dimensional Bose-Einstein condensates, we probe the remaining magnetic field variations at surface distances down to a few microns. Measurements on a 100 um wide wire imply that residual variations of the current flow result from local properties of the wire.Comment: submitted on September 24th, 200

Plantar Erythrodysesthesia Caused by Antiretroviral Treatment: A Case Report and Review of the Literature

Palmoplantar erythrodysesthesia is an uncommon localised cutaneous reaction to certain chemotherapeutic agents and characterized by painful palmoplantar erythema and dysesthesia. To the best of our knowledge, we report the first case of plantar erythrodysesthesia in a 40-year-old male patient receiving an antiretroviral combination therapy for HIV

The Cop Number of the One-Cop-Moves Game on Planar Graphs

Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game, alternately called the one-active-cop game, one-cop-moves game or the lazy-cops-and-robbers game, where at most one cop can move during any round. We show that Aigner and Frommer's result does not generalise to this game variant by constructing a connected planar graph on which a robber can indefinitely evade three cops in the one-cop-moves game. This answers a question recently raised by Sullivan, Townsend and Werzanski.Comment: 32 page