Results 71 to 80 of about 1,414,367 (299)
Molecular Oncology, EarlyView.In head and neck squamous cell carcinoma (HNSCC) p53 and p63 exert opposite roles on the transcription regulation of the lncRNA NEAT1. Under basal conditions, p53 levels are low and p63 represses NEAT1 expression. Upon genotoxic stress, p53 is rapidly induced, displacing p63 from the NEAT1 promoter leading to NEAT1 transcriptional activation and ...
Sara De Domenico +5 more
wiley +1 more source
Train scheduling with application to the UK rail network
, 2013 Nowadays, transforming the railway industry for better performance and making the best usage of the current capacity are the key issues in many countries.
Khosravi, Banafsheh
core +1 more source
Molecular Oncology, EarlyView.The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim +17 more
wiley +1 more source
IEEE Access, 2020 Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model
Guanqun Ni, Lei Chen
doaj +1 more source
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
FEBS Open Bio, EarlyView.Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee +3 more
wiley +1 more source
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. +3 more
core
IEEE AccessJob-shop scheduling is crucial in manufacturing systems but struggles with uncertainties like random job arrivals and disruptions. Traditional scheduling methods often rely on centralized control and predefined rules, limiting flexibility in dynamic ...
Hong-Phuc Nguyen +2 more
doaj +1 more source
job shop scheduling problem:literature review
Tikrit Journal of Pure Science, 2020 As an extension of the Job Shop Scheduling (JSP), Flexible job-shop Scheduling Problem (FJSP), can be defined as one of the most significant problems in up-to-date manufacturing systems, recently a lot of studies have been conducted to address FJSP ...
Marrwa Abd-AlKareem Alabajee +2 more
doaj +1 more source
A Genetic Algorithm for Job-Shop Scheduling
Journal of Software, 2010 In this paper, we analyze the characteristics of the job shop scheduling problem. A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution.
Ye Li, Yan Chen 0015
openaire +2 more sources
Versatile vector tools for efficient protein screening across multiple expression systems
FEBS Open Bio, EarlyView.A unified vector toolkit enables rapid protein expression screening across E. coli, insect, and mammalian cells. A single primer pair amplifies the target gene, which is inserted into any vector via a standardized interface. This streamlined workflow eliminates repeated cloning steps, accelerating the identification of optimal expression conditions for
Zhimin Zhu +5 more
wiley +1 more source