Results 101 to 110 of about 1,094,599 (317)

On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems

open access: yes, 2019
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Albert Ferrer   +4 more
core   +1 more source

Exponential bounds and tails for additive random recursive sequences [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2007
Analysis of ...
Ludger Rüschendorf, Eva-Maria Schopp
doaj   +1 more source

Heterozygous loss‐of‐function alleles associate the conserved 3′‐5′ exoribonuclease EXOSC10 with hypersensitivity to the anticancer drug 5‐fluorouracil

open access: yesMolecular Oncology, EarlyView.
EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain   +10 more
wiley   +1 more source

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

Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors

open access: yes, 2020
This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity.
Neeldhara Misra   +5 more
core   +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

Adaptor protein CIN85 potentiates the motility of osteosarcoma cells via the Akt/mTOR and MMP2‐COL3A1 axis

open access: yesMolecular Oncology, EarlyView.
CIN85 is highly expressed in osteosarcoma, particularly in metastatic lesions. Its overexpression increases cell migration and Matrigel invasion, while silencing CIN85 suppresses these behaviors. Transcriptome analysis shows that CIN85 regulates MMP2, COL3A1, and Akt/mTOR signaling. Targeting these pathways reverses CIN85‐induced motility, highlighting
Iryna Horak   +10 more
wiley   +1 more source

Interpreting the effects of DNA polymerase variants at the structural level

open access: yesMolecular Oncology, EarlyView.
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi   +7 more
wiley   +1 more source

Efficient algorithms for finding optimal binary features in numeric and nominal labeled data

open access: yes, 2013
An important subproblem in supervised tasks such as decision tree induction and subgroup discovery is finding an interesting binary feature (such as a node split or a subgroup refinement) based on a numeric or nominal attribute, with respect to some ...
Sub Algorithmic Data Analysis   +7 more
core   +1 more source

Finding the most relevant fragments in networks [PDF]

open access: yes, 2010
We study a point pattern detection problem on networks, motivated by applications in geographical analysis, such as crime hotspot detection. Given a network N (a connected graph with non-negative edge lengths) together with a set of sites, which lie on ...
Rote, G.   +9 more
core   +1 more source

Home - About - Disclaimer - Privacy