Results 81 to 90 of about 464,627 (312)
Molecular Oncology, EarlyView.Urinary LGALS3BP is elevated in bladder cancer patients compared to healthy controls as detected by the 1959 antibody–based ELISA. The antibody shows enhanced reactivity to the high‐mannose glycosylated variant secreted by cancer cells treated with kifunensine (KIF).
Asia Pece +18 more
wiley +1 more source
Fundamental groupoids of k-graphs [PDF]
, 2003 k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type.
Pask, David, Quigg, John, Raeburn, Iain
core +4 more sources
Geodesic laminations revisited
, 2006 The Bratteli diagram is an infinite graph which reflects the structure of projections in a C*-algebra. We prove that every strictly ergodic unimodular Bratteli diagram of rank 2g+m-1 gives rise to a minimal geodesic lamination with the m-component ...
A.J. Casson +6 more
core +2 more sources
Survivin and Aurora Kinase A control cell fate decisions during mitosis
Molecular Oncology, EarlyView.Aurora A interacts with survivin during mitosis and regulates its centromeric role. Loss of Aurora A activity mislocalises survivin, the CPC and BubR1, leading to disruption of the spindle checkpoint and triggering premature mitotic exit, which we refer to as ‘mitotic slippage’.
Hana Abdelkabir +2 more
wiley +1 more source
Q-system Cluster Algebras, Paths and Total Positivity
Symmetry, Integrability and Geometry: Methods and Applications, 2010 In the first part of this paper, we provide a concise review of our method of solution of the A_r Q-systems in terms of the partition function of paths on a weighted graph. In the second part, we show that it is possible to modify the graphs and transfer
Philippe Di Francesco, Rinat Kedem
doaj +1 more source
PLoS ONE, 2022 Genetic diversity within and among populations is frequently used in prioritization processes to rank populations based on their vulnerability or distinctiveness, however, connectivity and gene flow are rarely considered within these frameworks.
Cindy Bouchard +3 more
doaj +1 more source
An algebraic analysis of the graph modularity
, 2014 One of the most relevant tasks in network analysis is the detection of community structures, or clustering. Most popular techniques for community detection are based on the maximization of a quality function called modularity, which in turn is based upon
Fasino, Dario, Tudisco, Francesco
core +1 more source
Molecular Oncology, EarlyView.CDK11 inhibition stabilises the tumour suppressor p53 and triggers the production of an alternative p21WAF1 splice variant p21L, through the inactivation of the spliceosomal protein SF3B1. Unlike the canonical p21WAF1 protein, p21L is localised in the cytoplasm and has reduced cell cycle‐blocking activity.
Radovan Krejcir +12 more
wiley +1 more source
Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory
Journal of Applied Mathematics, 2012 Constructing structures with other mathematical theories is an important research field of rough sets. As one mathematical theory on sets, matroids possess a sophisticated structure.
Jianguo Tang, Kun She, William Zhu
doaj +1 more source
Journal of Geodesy, 2016 Graph theory is useful for analyzing time-dependent model parameters estimated from interferometric synthetic aperture radar (InSAR) data in the temporal domain.
Elena C. Reinisch, M. Cardiff, K. Feigl
semanticscholar +1 more source