Results 51 to 60 of about 190,756 (265)

Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin

open access: yesMolecular Oncology, EarlyView.
The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla   +10 more
wiley   +1 more source

Secure and Efficient Adjacency Search Supporting Synonym Query on Encrypted Graph in the Cloud

open access: yesIEEE Access, 2019
With the popularity of cloud computing, cloud outsourcing has aroused great concern in academia. A lot of graph data are outsourced to the cloud for saving cost.
Bin Wu   +4 more
doaj   +1 more source

Pan-genome de Bruijn graph using the bidirectional FM-index

open access: yesBMC Bioinformatics, 2023
Background Pan-genome graphs are gaining importance in the field of bioinformatics as data structures to represent and jointly analyze multiple genomes. Compacted de Bruijn graphs are inherently suited for this purpose, as their graph topology naturally ...
Lore Depuydt   +3 more
doaj   +1 more source

Identification of serum protein biomarkers for pre‐cancerous lesions associated with pancreatic ductal adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns   +10 more
wiley   +1 more source

A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes

open access: yesJurnal Nasional Pendidikan Teknik Informatika (JANAPATI)
The top-k shortest path problem is a fundamental topic in graph theory and pathfinding applications. Traditional approaches focus solely on finding k paths with the least total cost or distance, often resulting in highly similar paths that offer limited
Bagus Jati Santoso   +2 more
doaj   +1 more source

Leveraging graph dimensions in online graph search [PDF]

open access: yesProceedings of the VLDB Endowment, 2014
Graphs have been widely used due to its expressive power to model complicated relationships. However, given a graph database D g = { g 1 , g 2 , · · ·, g n
Yuanyuan Zhu, Jeffrey Xu Yu, Lu Qin
openaire   +1 more source

Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra   +6 more
wiley   +1 more source

FPS: Fast Path Planner Algorithm Based on Sparse Visibility Graph and Bidirectional Breadth-First Search

open access: yesRemote Sensing, 2022
The majority of planning algorithms used are based on the occupancy grid maps, but in complicated situations, the occupancy grid maps have a significant search overhead.
Qunzhao Li   +6 more
doaj   +1 more source

Establishment of a humanized patient‐derived xenograft mouse model of high‐grade serous ovarian cancer for preclinical evaluation of combination immunotherapy

open access: yesMolecular Oncology, EarlyView.
We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric   +10 more
wiley   +1 more source

Algorithm Based on Morphological Operators for Shortness Path Planning

open access: yesAlgorithms
The problem of finding the best path trajectory in a graph is highly complex due to its combinatorial nature, making it difficult to solve. Standard search algorithms focus on selecting the best path trajectory by introducing constraints to estimate a ...
Jorge L. Perez-Ramos   +6 more
doaj   +1 more source

Home - About - Disclaimer - Privacy