Results 131 to 140 of about 8,223,452 (320)
A reduction from an LWE problem to maximum independent set problems. [PDF]
Sci Rep, 2023 Kawano Y.
europepmc +1 more source
Learning-augmented Maximum Independent Set
We study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-hard to approximate to within a factor of $n^{1-δ}$ for any $δ>0$. We show that we can break this barrier in the presence of an oracle obtained through predictions from a ...
Braverman, Vladimir +3 more
openaire +4 more sources
The graph, range and level set singularity spectra of $b$-adic independent cascade function [PDF]
, 2010 With the "iso-H\"older" sets of a function we naturally associate subsets of the graph, range and level set of the function. We compute the associated singularity spectra for a class of statistically self-similar multifractal functions, namely the $b ...
Jin, Xiong
core
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
How to combine independent data sets for the same quantity [PDF]
, 2011 Theodore P. Hill, J. Miller
openalex +1 more source
On independent [1,2]-sets in trees
Discussiones Mathematicae Graph Theory, 2018 An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such sets is not guaranteed in every graph and trees having an independent $[1,k]$-set have been characterized.
Aleid Sahar A. +2 more
openaire +4 more sources
Peptide‐based ligand antagonists block a Vibrio cholerae adhesin
FEBS Letters, EarlyView.The structure of a peptide‐binding domain of the Vibrio cholerae adhesin FrhA was solved by X‐ray crystallography, revealing how the inhibitory peptide AGYTD binds tightly at its Ca2+‐coordinated pocket. Structure‐guided design incorporating D‐amino acids enhanced binding affinity, providing a foundation for developing anti‐adhesion therapeutics ...
Mingyu Wang +9 more
wiley +1 more source
Correction: Constructing Benchmark Test Sets for Biological Sequence Analysis Using Independent Set Algorithms. [PDF]
PLoS Comput Biol, 2023 Petti S, Eddy SR.
europepmc +1 more source
On Computing Maximal Independent Sets of Hypergraphs in Parallel [PDF]
, 2014 Ioana O. Bercea +3 more
openalex +1 more source
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source