Results 101 to 110 of about 5,273,588 (373)
Unimodular trees versus Einstein trees
The European Physical Journal C, 2016 20 pages, 5 ...
Álvarez, Enrique +2 more
openaire +4 more sources
Peripheral blood proteome biomarkers distinguish immunosuppressive features of cancer progression
Molecular Oncology, EarlyView.Immune status significantly influences cancer progression. This study used plasma proteomics to analyze benign 67NR and malignant 4T1 breast tumor models at early and late tumor stages. Immune‐related proteins–osteopontin (Spp1), lactotransferrin (Ltf), calreticulin (Calr) and peroxiredoxin 2 (Prdx2)–were associated with systemic myeloid‐derived ...
Yeon Ji Park +6 more
wiley +1 more source
A century of tree line changes in sub-Arctic Sweden shows local and regional variability and only a minor influence of 20th century climate warming [PDF]
, 2011 Aim Models project that climate warming will cause the tree line to move to higher elevations in alpine areas and more northerly latitudes in Arctic environments.
Callaghan, Terry V +5 more
core +1 more source
The Tree of Knowledge: The Biological Roots of Human Understanding
, 2007 A review of The Tree of Knowledge: The Biological Roots of Human Understanding, by Humberto R. Maturana and Francisco J. Varela, 1998 [1987]. Revised Edition. Boston and London: Shambhala Publications, 269 pp. ISBN 0877736421. $29.95 USD.
Yves Laberge
semanticscholar +1 more source
Fast approximation of search trees on trees with centroid trees
, 2022 Search trees on trees (STTs) generalize the fundamental binary search tree (BST) data structure: in STTs the underlying search space is an arbitrary tree, whereas in BSTs it is a path. An optimal BST of size $n$ can be computed for a given distribution of queries in $O(n^2)$ time [Knuth 1971] and centroid BSTs provide a nearly-optimal alternative ...
Berendsohn, Benjamin Aram +3 more
openaire +4 more sources
Game Tree Algorithms and Solution Trees [PDF]
Theoretical Computer Science, 1999 AbstractIn this paper a theory of game tree algorithms is presented, entirely based upon the concept of a solution tree. Two types of solution trees are distinguished: max and min trees. Every game tree algorithm tries to prune as many nodes as possible from the game tree.
Arie de Bruin, Wim Pijls
openaire +5 more sources
Adverse prognosis gene expression patterns in metastatic castration‐resistant prostate cancer
Molecular Oncology, EarlyView.We aggregated a cohort of 1012 mCRPC tissue samples from 769 patients and investigated the association of gene expression‐based pathways with clinical outcomes. Loss of AR signaling, high proliferation, and a glycolytic phenotype were independently prognostic for poor outcomes, and an adverse transcriptional feature score incorporating these pathways ...
Marina N. Sharifi +26 more
wiley +1 more source
A new view of the tree of life
Nature Microbiology, 2016 The tree of life is one of the most important organizing principles in biology1. Gene surveys suggest the existence of an enormous number of branches2, but even an approximation of the full scale of the tree has remained elusive. Recent depictions of the
L. Hug +16 more
semanticscholar +1 more source
Molecular Oncology, EarlyView.Presurgery 72‐h fasting in GB patients leads to adaptations of plasma lipids and polar metabolites. Fasting reduces lysophosphatidylcholines and increases free fatty acids, shifts triglycerides toward long‐chain TGs and increases branched‐chain amino acids, alpha aminobutyric acid, and uric acid.
Iris Divé +7 more
wiley +1 more source
Choosing the exponent in the definition of the connectivity index [PDF]
Journal of the Serbian Chemical Society, 2001 Let du denote the degree of the vertex u of a molecular graph G. Then the connectivity index of G is defined as C (l) = G (l; C) = S (dudu)l, where the summation goes over all pairs of adjacent vertices. The exponent l is usually chosen to be equal to 1/
MIRKO LEPOVIC, IVAN GUTMAN
doaj