Lactating rats exhibit stable individual differences in pup licking/grooming (LG) over the first week postpartum. Such naturally occurring variations in maternal behavior are associated with differences in estrogen-inducible oxytocin receptors in the medial preoptic area (MPOA) of the hypothalamus. We compared levels of ER and ER mRNA in the MPOA of lactating High or Low LG mothers as well as i...

As an element of the lacrimal apparatus, the lacrimal gland (LG) produces the aqueous part of the tear film, which protects the eye surface. Therefore, a defective LG can lead to serious eyesight impairment. Up to now, little is known about LG morphogenesis and subsequent maturation. In this study, we delineated elements of the cellular and molecular events involved in LG formation by using thr...

BACKGROUND In 1985, two independent reports highlighted a novel subtype of chronic inflammation in the gastric mucosa, characterized by the intraepithelial lymphocytic infiltration (ILI) both in the surface and the foveolar epithelium. The disease, subsequently called lymphocytic gastritis (LG) is a rare form of gastritis (0.8%-1.6% of cases), with unclear pathogenesis. More recently, LG was re...

The LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be obtained from both trees by deleting nodes. We present algorithms for computing tree LCS which exploit the sparsity inherent to the tree LCS problem. Assuming G is smaller than F , our first algorithm runs in time O(r · height(F ) · height(G) · lg lg |G|), where r is the number of pairs (v ∈ F,w ∈ G) suc...

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Θ(s) bits, where lgn ≤ s ≤ n · lg n. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of n points that runs in O(n/s+n·lg s) time. We give a simple algorithm to enum...

BACKGROUND Adipose-derived mesenchymal stromal cells (Ad-MSCs) are a promising tool for advanced cell-based therapies. They are routinely obtained enzymatically from fat lipoaspirate (LP) as SVF, and may undergo prolonged ex vivo expansion, with significant senescence and decline in multipotency. Besides, these techniques have complex regulatory issues, thus incurring in the compelling requirem...

A few papers develop full-fledged methods to estimate LG models. Binsbergen and Koijen (2009) study a LG model with time-varying risk premium and growth rate of stocks. Bekker and Bouwman (2009) estimate a three-factor LG term structure model. Carr, Gabaix and Wu (2009) show how calculate options in closed form in a LG term structure model, and perform an empirical analysis of bonds and fixed-i...

We present an algorithm for the parameterized feedback vertex set problem that runs in time O((2 lg k + 2 lg lg k + 18)n). This improves the previous O(max{12, (4 lg k)}n) algorithm by Raman et al. by roughly a 2 factor (n ∈ O(n) is the time needed to multiply two n × n matrices). Our results are obtained by developing new combinatorial tools and employing results from extremal graph theory. We...

We introduce a new O(lg lgn)-competitive binary search tree data structure called poketree that has the advantage of attaining, under worst-case analysis, O(lg n) cost per operation, including updates. Previous O(lg lgn)-competitive binary search tree data structures have not achieved O(lg n) worst-case cost per operation. A standard data structure such as red-black tree or deterministic skip l...

We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ lg n) element comparisons per deletion. Here, n denotes the number of elements stored in the data structure prior to the operation in question, and lg n is a shorthand for max {1, log2 n}. In contrast to a run-relaxed heap,...