Stem cells are undifferentiated self regenerating multi potential cells. There are three types of stem cells categories by the ability to form after cells and correlated with the body’s development process. Totipotent: these stem cells can form an entire organism such as fertilized egg. Ploripotent: ploripotent cells are those that can form any cell in the body but cannot form an entire organ...

The n-dimensional cube Q is the graph whose vertices are the subsets of {1, . . . , n} where two such vertices are adjacent if and only if their symmetric difference is a singleton. Clearly Q is an n-connected graph of diameter and radius n. Write M = n2n−1 = e(Q) for the size of Q. Let Q̃ = (Qt) M 0 be a random Q -process. Thus Qt is a spanning subgraph of Q n of size t, and Qt is obtained from...

18 Methylation at the N 6 position of adenosine (m 6 A) is a highly prevalent and reversible 19 modification within eukaryotic mRNAs that has been linked to many stages of RNA processing 20 and fate. Recent studies suggest that m 6 A deposition and proteins involved in the m 6

Abstract. Linear batch codes and codes for private information retrieval (PIR) with a query size t and a restricted size r of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of t or r by providing corresponding constructions. By building on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is derived for batch codes a...

We define the higher dimensional hexagonal graphs as the generalization of a triangular plane tessellation, and consider it as a multiprocessor interconnection network. Nodes in a k-dimensional (k-D) hexagonal network are placed at the vertices of a k-D triangular tessellation, so that each node has up to 2k þ 2 neighbors. In this paper, we propose a simple addressing scheme for the nodes, whic...

The spatial structure of reactants in the two-species annihilation reaction A + B ~ 0 is described. In one dimension, we investigate the distribution of domain sizes and the distributions of nearest-neighbor distances between particles of the same and of opposite species. The latter two quantities are characterized by a new length scale which is intermediate to the domain size t 1./2 and the ty...

Given a collection of matchings M = (M1,M2, . . . ,Mq) (repetitions allowed), a matching M contained in ⋃ M is said to be s-rainbow for M if it contains representatives from s matchings Mi (where each edge is allowed to represent just one Mi). Formally, this means that there is a function φ : M → [q] such that e ∈ Mφ(e) for all e ∈ M , and |Im(φ)| > s. Let f(r, s, t) be the maximal k for which ...

A conjecture of Erdős from 1965 suggests the minimum number of edges in a kuniform hypergraph on n vertices which forces a matching of size t, where t ≤ n/k. Our main result verifies this conjecture asymptotically, for all t < 0.48n/k. This gives an approximate answer to a question of Huang, Loh and Sudakov, who proved the conjecture for t ≤ n/3k. As a consequence of our result, we extend bound...