Results 101 to 110 of about 14,482,155 (299)

Catholic Women's Network, July / August, 1996

open access: yes, 1996
Digitized version of a newspaper published by the Catholic Women's Network (CWN), a non-profit educational organization for women's spirituality and personal growth.
Catholic Women's Network (Sunnyvale, Calif);
core   +1 more source

Catholic Women's Network, March / April, 1989

open access: yes, 1989
Digitized version of a newspaper published by the Catholic Women's Network (CWN), a non-profit educational organization for women's spirituality and personal growth.
Catholic Women's Network (Sunnyvale, Calif);
core   +1 more source

Steiner Tree Approximations in Graphs and Hypergraphs

open access: yesAlgorithms
The construction of partial minimum spanning trees is an NP-hard problem, leading to the development of various heuristic algorithms. Existing heuristics, including Kruskal’s algorithm, frequently employ shortest paths to connect tree components.
Miklós Molnár, Basma Mostafa Hassan
doaj   +1 more source

Translophagy—A potential link between autophagy impairment and translational errors

open access: yesFEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk   +11 more
wiley   +1 more source

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

The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation

open access: yesFEBS Letters, EarlyView.
Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge   +6 more
wiley   +1 more source

Fair and efficient network dimensioning with the reference point methodology

open access: yesJournal of Telecommunications and Information Technology, 2006
The dimensioning of telecommunication networks that carry elastic traffic requires the fulfillment of two conflicting goals: maximizing the total network throughput and providing fairness to all flows.
Włodzimierz Ogryczak   +2 more
doaj   +1 more source

Network design with grooming constraints

open access: yesElectronic Notes in Discrete Mathematics, 2004
Abstract Networks are physically and logically decomposed into layers with different technological features. Often, the routing of a demand through a non-multiplexing layer is made by grooming several demands at another, multiplexing-capable layer, thus using less capacity on the former but more on the latter.
BELOTTI P., MALUCELLI, FEDERICO
openaire   +2 more sources

Prospecting the protein design landscape

open access: yesFEBS Letters, EarlyView.
This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona   +4 more
wiley   +1 more source

Capacitated Multiple Allocation Hub Covering Flow Problem

open access: yesMANAS: Journal of Engineering, 2021
The aim of the Capacitated Multiple Allocation Hub Covering Flow Problem is to find theoptimal design for hub-and-spoke networks while taking into account hub opening and demandrouting costs.
Orhan Feyzioğlu, Nazmi Sener
doaj  

Home - About - Disclaimer - Privacy