منابع مشابه
Soluble St2 Blocks Il-33 Signaling in Allergic Airway Inflammation
SOLUBLE ST2 BLOCKS IL-33 SIGNALING IN ALLERGIC AIRWAY INFLAMMATION Hiroko Hayakawa1, Morisada Hayakawa1, Akihiro Kume2, and Shin-ichi Tominaga1 From the 1Department of Biochemistry and 2Division of Genetic Therapeutics, Jichi Medical University, 3311-1 Yakushiji, Shimotsuke-shi, Tochigi 329-0498, Japan Running Title: Suppression of IL-33 signaling by soluble ST2 Address correspondence to: Moris...
متن کاملSerum Soluble ST2 and Diastolic Dysfunction in Hypertensive Patients
BACKGROUND Echocardiographic evaluation of left ventricular (LV) structural and functional alterations in hypertension has some limitations, potentially overcome by using biomarkers. ST2, a prognostic biomarker for heart failure and myocardial infarction patients, was less studied in hypertension. AIM To analyze the relationship between serum ST2 levels and diastolic dysfunction (DD) in hyper...
متن کاملSoluble ST2: A Novel Prognostic Biomarker of Heart Failure.
Previous studies have demonstrated the role of ST2 in predicting hospitalization and mortality in heart failure, independent of natriuretic peptides and other clinical variables. 9-17 In 2011, the U.S. Food and Drug Administration (FDA) delared the Presage ST2 Assay (Critical Diagnostics, San Diego, California, USA), which is typically used in conjunction with clinical evaluation as an aid in a...
متن کاملSoluble ST2 predicts outcome and hemorrhagic transformation after acute stroke
OBJECTIVE ST2 is a member of the toll-like receptor superfamily that can alter inflammatory signaling of helper T-cells. We investigated whether soluble ST2 (sST2) could independently predict outcome and hemorrhagic transformation (HT) in the setting of stroke. METHODS We measured sST2 in patients enrolled in the Specialized Program of Translational Research in Acute Stroke (SPOTRIAS) network...
متن کاملP-completeness of Cellular Automaton Rule 110
We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-complete. The result is found by showing that Rule 110 simulates deterministic Turing machines in polynomial time. As a corollary we find that the small universal Turing machines of Mathew Cook run in polynomial time, this is an exponential improvement on their previously known simulation time overhead.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inflammatory Bowel Diseases
سال: 2014
ISSN: 1078-0998
DOI: 10.1097/01.mib.0000456863.48800.cf