Results 81 to 90 of about 6,450,253 (299)
Scalability of Betweenness Approximation Algorithms: An Experimental Review
IEEE Access, 2019 Betweenness centrality, which measures the contribution of an individual node to the network's connectivity by counting the number of shortest paths a node appears in, is widely used for the analysis of the complex networks.
Sebastian Wandelt +2 more
doaj +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
Journal of Numerical Analysis and Approximation Theory, 2006 We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMSTP, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a ...
Petrică C. Pop +2 more
doaj +2 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Transitivity Demolition and the Fall of Social Networks
IEEE Access, 2017 In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal. Specifically,
Hung T. Nguyen +4 more
doaj +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 +4 more
openaire +5 more sources
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials
AxiomsThis manuscript associates with a study of Frobenius–Euler–Simsek-type Polynomials. In this research work, we construct a new sequence of Szász–Beta type operators via Frobenius–Euler–Simsek-type Polynomials to discuss approximation properties for the ...
Nadeem Rao +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Keratin 19 (KRT19) is overexpressed in high‐grade serous ovarian cancer with high levels of Kallikrein‐related peptidases (KLK) 4–7 and is associated with poor survival. In vivo analyses demonstrate that elevated KRT19 increases peritoneal tumour burden.
Sophia Bielesch +13 more
wiley +1 more source
Edit Distance with Block Deletions
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source