Results 111 to 120 of about 2,913,313 (303)

A duality based 2-approximation algorithm for maximum agreement forest. [PDF]

Math Program, 2023
Olver N, Schalekamp F, van der Ster S, Stougie L, van Zuylen A.   +4 more
europepmc   +1 more source

Approximation algorithms for stochastic clustering

J. Mach. Learn. Res., 2018
We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including clustering which is fairer and has better long-term ...
David G. Harris 0001, Shi Li 0001, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl   +4 more
openaire   +5 more sources

Better approximation guarantees for job-shop scheduling [PDF]

Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee.
Paterson, Michael S., Srinavasan, Aravind, Goldberg, Leslie Ann, Sweedyk, Elizabeth   +3 more
core  

Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes

FEBS Open Bio, EarlyView.
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard, Emma‐Jayne Proctor, Jiawa Wang, Nikolas P. Johnston, Andrew Hayes, Georgia McCorkell, Haibo Yu, Jai Tree, Mark R. Davies, Mark J. Walker, Ronald Sluyter, Stephan Brouwer, Martina L. Sanderson‐Smith   +12 more
wiley   +1 more source

A new 1.375-approximation algorithm for sorting by transpositions. [PDF]

Algorithms Mol Biol, 2022
Silva LAG, Kowada LAB, Rocco NR, Walter MEMT.   +3 more
europepmc   +1 more source

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes [PDF]

, 2005
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka, Miroslav Chlebík, Chlebik, Miroslav, Miroslav Chlebik (4461319), Janka Chlebíková, Janka Chlebíková (16060964)   +5 more
core  

Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA

FEBS Open Bio, EarlyView.
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro, Fernando Lucas Palhano   +1 more
wiley   +1 more source

Approximation algorithms for a sequencing problem with a biased bipartite structure

Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016
Given a family of m + 1 sets of n vertices in a metric space, a bi-level optimization problem to be considered in this paper asks to find a minimum cost repetitive walk with a prescribed terminal vertex.
Aleksandar SHURBEVSKI, Hiroshi NAGAMOCHI, Yoshiyuki KARUNO   +2 more
doaj   +1 more source

Scelestial: Fast and accurate single-cell lineage tree inference based on a Steiner tree approximation algorithm. [PDF]

PLoS Comput Biol, 2022
Foroughmand-Araabi MH, Goliaei S, McHardy AC.   +2 more
europepmc   +1 more source

Structural studies and functional engineering of NanX: an anhydro‐sialic acid transporter from Escherichia coli

FEBS Open Bio, EarlyView.
Biophysical characterisation shows that NanX, a membrane transport protein from the major facilitator superfamily (MFS), forms both monomers and dimers after purification. AlphaFold modelling and substrate docking provide information on residues likely involved in substrate recognition for NanX and another MFS member, NanT.
Michael C. Newton‐Vesty, Kelsi R. Hall, Zachary D. Tillett, Liam S. Turk, James S. Davies, Michael J. Currie, Hamish G. Brown, Sepideh Valimehr, Peter D. Mace, Andrew E. Whitten, Santosh Panjikar, Eric Hanssen, Rachel A. North, Renwick C.J. Dobson   +13 more
wiley   +1 more source