Results 51 to 60 of about 595,721 (280)

Lie algebra configuration pairing [PDF]

open access: yes, 2016
We give an algebraic construction of the topological graph-tree configuration pairing of Sinha and Walter beginning with the classical presentation of Lie coalgebras via coefficients of words in the associative Lie polynomial.
Walter, Ben
core  

Splittable and unsplittable graphs and configurations

open access: yesArs Mathematica Contemporanea, 2018
19 pages, 10 ...
Bašić, Nino   +3 more
openaire   +5 more sources

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +1 more source

On clustering of conditional configuration graphs

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018
We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed limited random variables. They are equal to the number of vertex semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj   +1 more source

Kinematic Graph for Motion Planning of Robotic Manipulators

open access: yesRobotics, 2022
We introduce a kinematic graph in this article. A kinematic graph results from structuring the data obtained from the sampling method for sampling-based motion planning algorithms in robotics with the motivation to adapt the method to the positioning ...
Burkhard Corves, Amir Shahidi
doaj   +1 more source

Configurations with few crossings in topological graphs [PDF]

open access: yesComputational Geometry, 2005
In this paper we study the problem of computing subgraphs of a certain configuration in a given topological graph G such that the number of crossings in the subgraph is minimum. The configurations that we consider are spanning trees, s-t paths, cycles, matchings, and kappa-factors for kappa in {1,2}.
Knauer, Christian   +3 more
openaire   +4 more sources

pH‐mediated activation of the lysosomal arginine sensor SLC38A9

open access: yesFEBS Letters, EarlyView.
Cells monitor nutrient levels via the lysosomal transporter SLC38A9 to activate the mechanistic target of rapamycin complex 1 (mTORC1). This study reveals that SLC38A9 function is regulated by pH. We identified histidine 544 as a critical pH sensor that undergoes conformational changes to control amino acid efflux from lysosomes; therefore, it ...
Xuelang Mu, Ampon Sae Her, Tamir Gonen
wiley   +1 more source

An algorithm to prescribe the configuration of a finite graph [PDF]

open access: yes, 2010
We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization of an ...
Baird, Paul, Tiba, Marius
core  

The Configuration Model for Partially Directed Graphs [PDF]

open access: yesJournal of Statistical Physics, 2015
19 pages, 3 figures, 2 ...
Kristoffer Spricer, Tom Britton
openaire   +2 more sources

LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro

open access: yesMolecular Oncology, EarlyView.
Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix   +13 more
wiley   +1 more source

Home - About - Disclaimer - Privacy