Results 131 to 140 of about 1,239,128 (324)

Defective and Clustered Graph Colouring [PDF]

Electronic Journal of Combinatorics, #DS23, http://www.combinatorics.org/DS23, 2018, 2018
Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$. A colouring has "clustering" $c$ if each monochromatic component has at most $c$ vertices.
arxiv  

Molecular and functional profiling unravels targetable vulnerabilities in colorectal cancer

Molecular Oncology, EarlyView.
We used whole exome and RNA‐sequencing to profile divergent genomic and transcriptomic landscapes of microsatellite stable (MSS) and microsatellite instable (MSI) colorectal cancer. Alterations were classified using a computational score for integrative cancer variant annotation and prioritization.
Efstathios‐Iason Vlachavas, Konstantinos Voutetakis, Vivian Kosmidou, Spyridon Tsikalakis, Spyridon Roditis, Konstantinos Pateas, Ryangguk Kim, Kymberleigh Pagel, Stephan Wolf, Gregor Warsow, Antonia Dimitrakopoulou‐Strauss, Georgios N. Zografos, Alexander Pintzas, Johannes Betge, Olga Papadodima, Stefan Wiemann   +15 more
wiley   +1 more source

The analysis of the RBL-STEM application in improving student financial literacy in controlling consumptive behavior

Heliyon
This study aims to analyze the application of the RBL-STEM learning model in improving students' financial literacy to control their consumptive behavior.
Sumarno, Gimin, Eddy Noviana, Dafik, Zainur Rasyid Ridlo, Indah Lutfiyatul Mursyidah   +5 more
doaj  

Targeting PRAME directly or via EZH2 inhibition overcomes retinoid resistance and represents a novel therapy for keratinocyte carcinoma

Molecular Oncology, EarlyView.
The study evaluated the function and therapeutic implications of PRAME in basal cell carcinoma (BCC) and squamous cell carcinoma (SCC). The findings demonstrate that PRAME impairs keratinocyte differentiation pathways. Furthermore, PRAME impairs anticancer response to retinoid compounds in BCC and SCC cells.
Brandon Ramchatesingh, Amelia Martinez Villarreal, Philippe Lefrançois, Jennifer Gantchev, Sriraam Sivachandran, Samy Abou Setah, Ivan V. Litvinov   +6 more
wiley   +1 more source

Classification of acute myeloid leukemia based on multi‐omics and prognosis prediction value

Molecular Oncology, EarlyView.
The Unsupervised AML Multi‐Omics Classification System (UAMOCS) integrates genomic, methylation, and transcriptomic data to categorize AML patients into three subtypes (UAMOCS1‐3). This classification reveals clinical relevance, highlighting immune and chromosomal characteristics, prognosis, and therapeutic vulnerabilities.
Yang Song, Zhe Wang, Guangji Zhang, Jiangxue Hou, Kaiqi Liu, Shuning Wei, Yan Li, Chunlin Zhou, Dong Lin, Min Wang, Hui Wei, Jianxiang Wang, Tao Cheng, Yingchang Mi   +13 more
wiley   +1 more source

COVID-19 pandemic in Africa’s island nations during the first 9 months: a descriptive study of variation in patterns of infection, severe disease, and response measures

BMJ Global Health, 2022
Cristina Barroso Hofer, Benido Impouma, Olivia Keiser, Cleophas Chimbetete, Jyoti Dalal, Ananthu James, Sara Botero Mesa, Jessica Lee Abbate, Franck Mboussou, Timokleia Kousi, Daniela Vivacqua, Daniel Cardoso Portela Câmara, George Sie Williams, Tamayi Mlanda, Arish Bukhari   +14 more
doaj   +1 more source

On vertex, edge, and vertex-edge random graphs [PDF]

arXiv, 2008
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdos-Renyi random graphs, vertex random graphs are generalizations of geometric random graphs, and vertex-edge random graphs generalize both.
arxiv  

On the theory of graphs [PDF]

, 1954
P. Túrán
openalex   +1 more source

Graph Neural Networks for Graph Drawing

IEEE Transactions on Neural Networks and Learning Systems
Accepted for publication in IEEE Transaction of Neural Networks and Learning Systems (TNNLS) 2022, Special Issue on Deep Neural Networks for Graphs: Theory, Models, Algorithms and ...
Matteo Tiezzi, Gabriele Ciravegna, Marco Gori   +2 more
openaire   +7 more sources

Supereulerian Graphs and the Petersen Graph

Journal of Combinatorial Theory, Series B, 1996
AbstractAny 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph.
Hong-Jian Lai, Paul A. Catlin
openaire   +2 more sources