Results 61 to 70 of about 1,946,730 (334)

Time after time – circadian clocks through the lens of oscillator theory

FEBS Letters, EarlyView.
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo, Carolin Ector, Hanspeter Herzel   +2 more
wiley   +1 more source

Maintenance of Strongly Connected Component in Shared-memory Graph

, 2018
In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads.
C Demetrescu, DS Hirschberg, J Hopcroft, MR Henzinger, Y Shiloach   +4 more
core   +1 more source

PARP inhibitors elicit distinct transcriptional programs in homologous recombination competent castration‐resistant prostate cancer

Molecular Oncology, EarlyView.
PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham, Jasibel Vasquez‐Gonzalez, Samantha M. Barnada, Salome Tchotorlishvili, Latese Jones, Ryan Maguire, Genevieve Lewis, Kinza Rizwan, Jenny Deng, Salma Koachar, Drithi Patel, Hailey Shankle, Tessa Mulders, Namra Ajmal, Charalambos Solomides, Emad S. Alnemri, Teresa F. Alnemri, Ayesha A. Shafi, Leonard G. Gomella, Wm Kevin Kelly, Steven B. McMahon, Matthew J. Schiewer   +21 more
wiley   +1 more source

Solutions of Detour Distance Graph Equations

Sensors, 2022
Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs.
S. Celine Prabha, M. Palanivel, S. Amutha, N. Anbazhagan, Woong Cho, Hyoung-Kyu Song, Gyanendra Prasad Joshi, Hyeonjoon Moon   +7 more
doaj   +1 more source

Bar 1-Visibility Drawings of 1-Planar Graphs

, 2013
A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean, E.N. Argyriou, G. Battista Di, H. Dehkordi, I. Fabrici, J. Pach, K. Arikushi, P. Eades, P. Selvaraju, R. Tamassia, V.P. Korzhik, W. Didimo, W. Didimo, Y. Suzuki   +13 more
core   +1 more source

Characterizing the salivary RNA landscape to identify potential diagnostic, prognostic, and follow‐up biomarkers for breast cancer

Molecular Oncology, EarlyView.
This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan, Irina Primac, Emre Etlioglu, Laurens Debruyne, Ann Janssen, Magy Sallam, Kevin Tabury, Roel Quintens, Wiebren Tjalma, Mohammed Abderrafi Benotmane   +9 more
wiley   +1 more source

Relations between the distinguishing number and some other graph parameters [PDF]

ریاضی و جامعه
A distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi, Seyed Alireza Talebpour Shirazi Fard   +1 more
doaj   +1 more source

Under which conditions is λ″(G)=κ″(L(G))?

AKCE International Journal of Graphs and Combinatorics, 2023
In this paper we show that if G is a connected graph such that [Formula: see text], [Formula: see text] and [Formula: see text] then [Formula: see text] exists and [Formula: see text] if and only if G is not super-[Formula: see text]. We also obtain some
Farnaz Soliemany, Mohsen Ghasemi, Rezvan Varmazyar   +2 more
doaj   +1 more source

Integrated genomic and proteomic profiling reveals insights into chemoradiation resistance in cervical cancer

Molecular Oncology, EarlyView.
A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath, Irene A. George, Srikanth S. Manda, Prasanth Ariyannur, Ekta R. Dhawale, Raja Sekhar Kommu, Rajan Datar, Darshana Patil, Vinita Trivedi, Manisha Singh, Kumar Prabhash, Sewanti Limaye, Richa Chauhan, Prashant Kumar   +13 more
wiley   +1 more source

Grid Representations and the Chromatic Number [PDF]

, 2012
A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect.
Balko, Martin
core   +1 more source