Results 51 to 60 of about 1,363,530 (305)

From junk to function — How weak selection in eukaryotes builds new parts and drives genomic complexity

open access: yesFEBS Letters, EarlyView.
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley   +1 more source

Optimal Allocation of Protective Resources in Shortest-Path Networks [PDF]

open access: yes, 2008
We develop a game theoretic approach for allocating protection resources among the components of a network so as to maximize its robustness to external disruptions.
Cappanera, Paola, Scaparra, Maria Paola
core  

Mitochondrial translation and coordinated cytosolic translation in metabolic homeostasis and disease

open access: yesFEBS Letters, EarlyView.
Mitochondrial function depends on coordinated protein production from the nuclear and mitochondrial genomes. This review highlights how cytosolic and mitochondrial translation, mRNA localization, protein import, and respiratory complex assembly are integrated to maintain mitochondrial proteostasis and function.
Boseon Kim   +4 more
wiley   +1 more source

Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections

open access: yesJournal of Advanced Transportation, 2023
Theoretical research is conducted on finding the shortest path with stochastic and time-dependent characteristics of link travel time in urban road networks.
Yanming Sun, Jie Li, Shixian Liu
doaj   +1 more source

On Dynamic Shortest Paths Problems [PDF]

open access: yesAlgorithmica, 2004
From the authors' abstract: ``We obtain the following results related to dynamic versions of the shortest-paths problem:'' (i) ``Reductions that show that the incremental and decremental single-source shortest-paths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest-paths ...
Liam Roditty, Uri Zwick
openaire   +3 more sources

Reconfiguring Shortest Paths in Graphs

open access: yesAlgorithmica, 2022
AbstractReconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) repaving road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the ...
Kshitij Gajjar   +3 more
openaire   +5 more sources

Inhibition of cyclin‐dependent kinases 12/13 using CT7439 as a treatment for colorectal cancer with CDK12 upregulation

open access: yesMolecular Oncology, EarlyView.
The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington   +10 more
wiley   +1 more source

Fuzzy Shortest Path Problem Based on Level 𝜆-Triangular LR Fuzzy Numbers

open access: yesAdvances in Fuzzy Systems, 2012
In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention.
S. Elizabeth, L. Sujatha
doaj   +1 more source

The Discrepancy of Shortest Paths

open access: yesCoRR
The hereditary discrepancy of a set system is a certain quantitative measure of the pseudorandom properties of the system. Roughly, hereditary discrepancy measures how well one can $2$-color the elements of the system so that each set contains approximately the same number of elements of each color.
Greg Bodwin   +5 more
openaire   +6 more sources

The complexity of rerouting shortest paths [PDF]

open access: yesTheoretical Computer Science, 2012
The results on claw-free graphs, chordal graphs and isolated paths have been added in version 2 (april 2012). Version 1 (September 2010) only contained the PSPACE-hardness result. (Version 2 has been submitted.)
openaire   +3 more sources

Home - About - Disclaimer - Privacy