Zobrazeno 1 - 10
of 1 064
pro vyhledávání: '"A. Shekarriz"'
Publikováno v:
Computers & Operations Research, 106893, November 2024
For $0<\rho\leq 1$, a $\rho$-happy vertex $v$ in a coloured graph $G$ has at least $\rho\cdot \mathrm{deg}(v)$ same-colour neighbours, and a $\rho$-happy colouring (aka soft happy colouring) of $G$ is a vertex colouring that makes all the vertices $\
Externí odkaz:
http://arxiv.org/abs/2405.15663
Autor:
Ramin Shekarriz, Neshat Roudbari
Publikováno v:
Journal of Mazandaran University of Medical Sciences, Vol 34, Iss 237, Pp 135-144 (2024)
Background and purpose: Colorectal cancer (CRC) is a significant and costly health issue worldwide, particularly in developing countries like Iran. As the third most common cancer globally, its prevalence varies considerably across different geograph
Externí odkaz:
https://doaj.org/article/43fc9ba835234476bf352d1fc6a89a60
Autor:
Mehrdad Hashemi, Elaheh Mohandesi Khosroshahi, Saba Asadi, Mahsa Tanha, Forough Ghatei Mohseni, Ramina Abdolmohammad Sagha, Elham Taheri, Paria Vazayefi, Helya Shekarriz, Fatemeh Habibi, Shaghayegh Mortazi, Ramin Khorrami, Noushin Nabavi, Mohsen Rashidi, Afshin Taheriazam, Payman Rahimzadeh, Maliheh Entezari
Publikováno v:
Non-coding RNA Research, Vol 10, Iss , Pp 1-15 (2025)
Cancer progression results from the dysregulation of molecular pathways, each with unique features that can either promote or inhibit tumor growth. The complexity of carcinogenesis makes it challenging for researchers to target all pathways in cancer
Externí odkaz:
https://doaj.org/article/ffc373024d574d789b422039da6e9a98
Publikováno v:
In Journal of Industrial and Engineering Chemistry 25 October 2024 138:440-450
Autor:
Hashemi, Mehrdad, Mohandesi Khosroshahi, Elaheh, Asadi, Saba, Tanha, Mahsa, Ghatei Mohseni, Forough, Abdolmohammad Sagha, Ramina, Taheri, Elham, Vazayefi, Paria, Shekarriz, Helya, Habibi, Fatemeh, Mortazi, Shaghayegh, Khorrami, Ramin, Nabavi, Noushin, Rashidi, Mohsen, Taheriazam, Afshin, Rahimzadeh, Payman, Entezari, Maliheh
Publikováno v:
In Non-coding RNA Research February 2025 10:1-15
Publikováno v:
In Computers and Operations Research February 2025 174
Autor:
Ramin Shekarriz, Hadi Jabbari, Reza Alikhani, Reza Alizadeh-Navaei, Mohammad Bagher Hashemi‑Soteh
Publikováno v:
Caspian Journal of Internal Medicine, Vol 15, Iss 1, Pp 132-140 (2024)
Background: The MUC1 gene encodes glycoproteins attached to cell membrane that play a protective role in gastric cancer and protect epithelial surfaces against external factors such as Helicobacter pylori. H. pylori infection can induce a cascade of
Externí odkaz:
https://doaj.org/article/43ca998dfa734d35a025d308e71cad03
Autor:
Joseph Giacolone, Robin Osofsky, Benjamin Matheson, Gabriela Perales, Reza Shekarriz, Nancy Kanagy, Ross M. Clark
Publikováno v:
Biomolecules, Vol 14, Iss 11, p 1350 (2024)
Ischemic wounds are frequently encountered in clinical practice and may be related to ischemia secondary to diabetes, peripheral artery disease and other chronic conditions. Angiogenesis is critical to the resolution of ischemia. Hydrogen sulfide (H2
Externí odkaz:
https://doaj.org/article/270c0940e18b488c919c4679847fce7d
Publikováno v:
The Art of Discrete and Applied Mathematics, Vol. 6 No. 2 (2023)
A coloring is distinguishing (or symmetry breaking) if no non-identity automorphism preserves it. The distinguishing threshold of a graph $G$, denoted by $\theta(G)$, is the minimum number of colors $k$ so that every $k$-coloring of $G$ is distinguis
Externí odkaz:
http://arxiv.org/abs/2111.07268
Autor:
Shekarriz, Mohammad Hadi, Fard, Seyed Alireza Talebpour Shirazi, Ahmadi, Bahman, Haghighi, Mohammad Hassan Shirdareh, Alikhani, Saeid
Publikováno v:
Iranian Journal of Science and Technology, Transactions A: Science (2022)
A vertex coloring of a graph $G$ is distinguishing if non-identity automorphisms do not preserve it. The distinguishing number, $D(G)$, is the minimum number of colors required for such a coloring and the distinguishing threshold, $\theta(G)$, is the
Externí odkaz:
http://arxiv.org/abs/2109.00045