Results 71 to 80 of about 36,225 (338)
Finding shortest non-trivial cycles in directed graphs on surfaces
Journal of Computational Geometry, 2016 Let $D$ be a weighted directed graph cellularly embedded in a surface of genus $g$, orientable or not, possibly with boundary. We describe algorithms to compute shortest non-contractible and shortest surface non-separating cycles in $D$, generalizing ...
Sergio Cabello +2 more
doaj +1 more source
Cytoplasmic p21 promotes stemness of colon cancer cells via activation of the NFκB pathway
Molecular Oncology, EarlyView.Cytoplasmic p21 promotes colorectal cancer stem cell (CSC) features by destabilizing the NFκB–IκB complex, activating NFκB signaling, and upregulating BCL‐xL and COX2. In contrast to nuclear p21, cytoplasmic p21 enhances spheroid formation and stemness transcription factor CD133.
Arnatchai Maiuthed +10 more
wiley +1 more source
A divide and conquer algorithm for triangle mesh connectivity encoding [PDF]
10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings., 2003 We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the mesh into two submeshes which are encoded separately in a recursive process.
Ivrissimtzis, I. +2 more
openaire +2 more sources
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
A two-phase bootstrap approach to facilitate conversion from text to semantic graphs
Discover ComputingThis paper proposes a two-phase unlearnable approach for converting a text into its semantic graph, addressing the challenge of efficiently generating a fully connected representation. Existing text-to-graph conversion tools struggle with processing long
Mohamed Abd-Elrahem +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad +12 more
wiley +1 more source
PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL
E-Jurnal Matematika, 2013 Computational geometry is the mathematical science of computation by using the algorithm analysis to solve the problems of geometry. The problems of computational include polygon triangulations, convex hulls, Voronoi diagrams, and motion planning. Convex
AGUS EKA ARIESTA +3 more
doaj +1 more source
Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP
Scientific Reports, 2023 Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel.
Sirilak Ketchaya, Apisit Rattanatranurak
doaj +1 more source
Optimal segmentation of directed graph and the minimum number of feedback arcs
, 2017 The minimum feedback arc set problem asks to delete a minimum number of arcs (directed edges) from a digraph (directed graph) to make it free of any directed cycles.
Xu, Yi-Zhi, Zhou, Hai-Jun
core +1 more source
Kart: a divide-and-conquer algorithm for NGS read alignment [PDF]
Bioinformatics, 2017 Abstract Motivation Next-generation sequencing (NGS) provides a great opportunity to investigate genome-wide variation at nucleotide resolution. Due to the huge amount of data, NGS applications require very fast and accurate alignment algorithms.
Lin, Hsin-Nan, Hsu, Wen-Lian
openaire +2 more sources