11 research outputs found
How many endomyocardial biopsies are necessary in the first year after heart transplantation?
Effectiveness of implementing a decentralized delivery of hepatitis C virus treatment with direct-acting antivirals: A systematic review with meta-analysis
A global initiative for ecological and evolutionary hologenomics
The Earth Hologenome Initiative (EHI) is a global collaboration to generate and analyse hologenomic data from wild animals and associated microorganisms using standardised methodologies underpinned by open and inclusive research principles. Initially focused on vertebrates, it aims to re-examine ecological and evolutionary questions by studying host–microbiota interactions from a systemic perspective
Nearly tight bounds for testing function isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g: {0, 1} n → {0, 1}. Our main focus is on the most studied case, where one of the functions is given (explicitly) and the other function may be queried. We prove that for every k ≤ n, the worst-case query complexity of testing isomorphism to a given k-junta is Ω(k) and O(k log k). Consequently, the query complexity of testing function isomorphism is e Θ(n). Prior to this work, only lower bounds of Ω(log k) queries were known, for limited ranges of k, proved by Fischer et al. (FOCS 2002), Blais and O’Donnell (CCC 2010), and recently by Alon and Blais (RANDOM 2010). The nearly tight O(k log k) upper bound improves on the e O(k 4) upper bound from Fischer et al. (FOCS 2002). Extending the lower bound proof, we also show polynomial query-complexity lower bounds for the problems of testing whether a function can be computed by a circuit of size ≤ s, and testing whether the Fourier degree of a function is ≤ d. This answers questions posed by Diakonikolas et al. (FOCS 2007). We also address two closely related problems – 1. Testing isomorphism to a k-junta with one-sided error: we prove that for any 1 < k < n − 1, the query complexity is Ω(log ` ´ n), which is almost optimal. Thi
Eosinophils in the Tumor Microenvironment
Eosinophils are rare blood-circulating and tissue-infiltrating immune cells studied for decades in the context of allergic diseases and parasitic infections. Eosinophils can secrete a wide array of soluble mediators and effector molecules, with potential immunoregulatory activities in the tumor microenvironment (TME). These findings imply that these cells may play a role in cancer immunity. Despite these cells were known to infiltrate tumors since many years ago, their role in TME is gaining attention only recently. In this chapter, we will review the main biological functions of eosinophils that can be relevant within the TME. We will discuss how these cells may undergo phenotypic changes acquiring pro- or antitumoricidal properties according to the surrounding stimuli. Moreover, we will analyze canonical (i.e., degranulation) and unconventional mechanisms (i.e., DNA traps, exosome secretion) employed by eosinophils in inflammatory contexts, which can be relevant for tumor immune responses. Finally, we will review the available preclinical models that could be employed for the study of the role in vivo of eosinophils in cancer