Results 81 to 90 of about 2,902,197 (338)

Cell wall target fragment discovery using a low‐cost, minimal fragment library

open access: yesFEBS Letters, EarlyView.
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan   +5 more
wiley   +1 more source

Globally optimal triangulations of minimum weight using Ant Colony Optimization metaheuristic

open access: yesJournal of Computer Science and Technology, 2010
Globally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem of a given set of n points in the
María Gisela Dorzán   +3 more
doaj  

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

open access: yesJournal of Applied Mathematics, 2012
Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj   +1 more source

PARP inhibitors elicit distinct transcriptional programs in homologous recombination competent castration‐resistant prostate cancer

open access: yesMolecular Oncology, EarlyView.
PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham   +21 more
wiley   +1 more source

Characterizing the salivary RNA landscape to identify potential diagnostic, prognostic, and follow‐up biomarkers for breast cancer

open access: yesMolecular Oncology, EarlyView.
This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan   +9 more
wiley   +1 more source

Minimum-weight springs [PDF]

open access: yes
Load deflection curves for minimum weight ...
Fuchs, H. O.
core   +1 more source

Bridging the gap: Multi‐stakeholder perspectives of molecular diagnostics in oncology

open access: yesMolecular Oncology, EarlyView.
Although molecular diagnostics is transforming cancer care, implementing novel technologies remains challenging. This study identifies unmet needs and technology requirements through a two‐step stakeholder involvement. Liquid biopsies for monitoring applications and predictive biomarker testing emerge as key unmet needs. Technology requirements vary by
Jorine Arnouts   +8 more
wiley   +1 more source

Minor stars in plane graphs with minimum degree five

open access: yes, 2018
The weight of a subgraph $H$ in $G$ is the sum of the degrees in $G$ of vertices of $H$. The {\em height} of a subgraph $H$ in $G$ is the maximum degree of vertices of $H$ in $G$.
Li, Yangfan, Rao, Mengjiao, Wang, Tao
core   +1 more source

Adenosine‐to‐inosine editing of miR‐200b‐3p is associated with the progression of high‐grade serous ovarian cancer

open access: yesMolecular Oncology, EarlyView.
A‐to‐I editing of miRNAs, particularly miR‐200b‐3p, contributes to HGSOC progression by enhancing cancer cell proliferation, migration and 3D growth. The edited form is linked to poorer patient survival and the identification of novel molecular targets.
Magdalena Niemira   +14 more
wiley   +1 more source

Minimum switching network for generating the weight of a binary vector [PDF]

open access: yes, 1973
Vector is divided into three variable sections, and each section is processed by unary-to-binary decoder or adder. Resulting network performs on iterative collection process; all outputs of same kind are collected in same manner.
Anderson, T. O.
core   +1 more source

Home - About - Disclaimer - Privacy