Results 111 to 120 of about 167,516,375 (307)

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

open access: yesMolecular Oncology, EarlyView.
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley   +1 more source

Analysis of Grain’s Initialization Algorithm [PDF]

open access: yes, 2008
In this paper, we analyze the initialization algorithm of Grain, one of the eSTREAM candidates which made it to the third phase of the project. We point out the existence of a sliding property in the initialization algorithm of the Grain family, and show that it can be used to reduce by half the cost of exhaustive key search (currently the most ...
De Cannière, Christophe   +2 more
openaire   +3 more sources

Profiling neoadjuvant therapy response in rectal cancer using meta‐analysis of publicly available transcriptomic RNA‐seq datasets

open access: yesMolecular Oncology, EarlyView.
This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic   +10 more
wiley   +1 more source

Fast Approximation Algorithms and Complexity Analysis for Design of Networked Systems

open access: yes, 2019
Presented on November 18, 2019 at 11:00 a.m. in the Klaus Advanced Computing Building, Room 1116E.Yuhao Yi is a postdoctoral researcher in Computer Science at Rensselaer Polytechnic Institute (RPI).
Yi, Yuhao
core  

A Comparative Study of Maze Generation Algorithms in a Game-Based Mobile Learning Application for Learning Basic Programming Concepts

open access: yes
This study evaluates several maze generation algorithms applied to generate mazes in a game-based Android mobile application designed to support children in learning basic programming concepts and computational thinking.
Ivica Dodig   +3 more
core   +1 more source

Paclitaxel induces NM2‐dependent cellular contraction through GEF‐H1 dissociation from microtubules and RhoA/ROCK activation in cancer cells

open access: yesMolecular Oncology, EarlyView.
Taxanes are widely used chemotherapeutics whose effects on cellular mechanics remain poorly understood. We show that paclitaxel induces rapid cellular contraction by promoting GEF‐H1 dissociation from microtubules and non‐muscle myosin II activation through RhoA/ROCK.
Gloria Asensio‐Juárez   +5 more
wiley   +1 more source

Analytic analysis of algorithms

open access: yes, 1992
The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial structures.
openaire   +2 more sources

Fourier Analysis of Genetic Algorithms

open access: yesTheoretical Computer Science, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walter A. Kosters   +2 more
openaire   +1 more source

p190A/ARHGAP35 and p190B/ARHGAP5 proteins in endometrial cancer: a novel cancer‐relevant paralog interplay

open access: yesMolecular Oncology, EarlyView.
This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault   +12 more
wiley   +1 more source

On the analysis of algorithms for trees

open access: yesTheoretical Computer Science, 1977
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nodes of a given height in a set of given trees. The aim of this article is to present a theorem that reduces such an enumeration, under certain conditions of regularity, to the simplest or most well known enumeration of a particular family of trees ...
openaire   +1 more source

Home - About - Disclaimer - Privacy