Results 91 to 100 of about 307,259 (304)

Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations

open access: yesFEBS Letters, EarlyView.
The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas   +6 more
wiley   +1 more source

Hardness of Approximation for Crossing Number [PDF]

open access: yesDiscrete & Computational Geometry, 2012
We show that, if P\not=NP, there is a constant c > 1 such that there is no c-approximation algorithm for the crossing number, even when restricted to 3-regular graphs.
openaire   +2 more sources

Microbiome−host proteostasis crosstalk—An emerging perspective on mechanisms and interventions toward healthy longevity

open access: yesFEBS Letters, EarlyView.
Proteostasis and the gut microbiota play a key role in shaping host physiology. Microbiota‐derived metabolites, vitamins, and RNA modulate host proteostasis. Findings from model systems, including C. elegans, indicate microbes can either stabilize or disrupt host proteostasis.
Abhishek Anil Dubey, Maria Ermolaeva
wiley   +1 more source

Hypohamiltonian Graphs and their Crossing Number [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2012
We prove that for every $k \ge 0$ there is an integer $n_0(k)$ such that, for every $n \ge n_0$, there exists a hypohamiltonian graph which has order $n$ and crossing number $k$.
openaire   +3 more sources

The Crossing Numbers of Products of Path with Graphs of Order Six

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj   +1 more source

From mice to humans—divergent strategies for intestinal homeostasis and regeneration

open access: yesFEBS Letters, EarlyView.
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa   +2 more
wiley   +1 more source

The crossing number of K2,m□Pn

open access: yes, 2008
Investigation of the crossing number of graphs is a classical but very difficult problem. The exact value of the crossing number is known only for a few specific families of graphs.
Zheng, Wenping   +2 more
core   +1 more source

Crossing Number for Graphs with Bounded~Pathwidth [PDF]

open access: yes, 2017
The crossing number is the smallest number of pairwise edge crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios.
Biedl, Therese   +3 more
core   +1 more source

PARK(ing) time–How park deficiency affects the biological clock in a Drosophila model of Parkinson's disease

open access: yesFEBS Letters, EarlyView.
Drosophila park mutants serve as a model for Parkinson's disease. We used this strain to investigate the connection between oxidative stress and the circadian clock mechanism. We showed that increased oxidative stress affects the physiology of pacemaker cells, disrupting their daily structural plasticity. Lack of rhythmic signaling from pacemaker cells
Kamila Zientara   +3 more
wiley   +1 more source

Retracing and adjusting edge algorithm for crossing reduction

open access: yes, 2010
碩士「最小化交叉點問題」是指將網路節點配置在平面上,試著去找出一個較佳的配置方式,使得網路連線與連線之間產生的交叉點最少。在許多的應用中,例如Circuit Board Layout、VLSI Circuit Layout、Automated Graph Drawing等,「最小化交叉點問題」一直是相當重要的一環,愈低的交叉點數量,往往代表著愈低的成本。在這篇論文中,我們研究的題目比「最小化交叉點問題」更特定,我們僅討論FLCNP(Fixed Linear Crossing Number Problem)
蕭宏仁; Hsiao, Hung-jen
core  

Home - About - Disclaimer - Privacy