Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Yingyu, Lu"'
Publikováno v:
Shipin gongye ke-ji, Vol 43, Iss 5, Pp 356-365 (2022)
Objective: To explore the inhibitive effect and underlying mechanism of Morinda officinalis (MO) on human colorectal cancer cell HCT-116 xenograft tumor model. Methods: Xenograft tumor model was established through transplanting human colorectal canc
Externí odkaz:
https://doaj.org/article/b636fbf6a99d4182be00e26c788a34c6
Publikováno v:
Heliyon, Vol 9, Iss 3, Pp e14526- (2023)
The foundation for the environmental department to take suitable measures and make a significant contribution towards improving air quality is the precise and dependable prediction of PM2.5 concentration. It is essential to review the development pro
Externí odkaz:
https://doaj.org/article/7ad0818684524eb5888efa10e18de195
Autor:
Xuewen Wang, Chengfei Zhao, Dandan Huang, Zhoujie Liu, Mengmeng Liu, Fei Lin, Yingyu Lu, Jing Jia, Liqing Lin, Xinhua Lin, Huangyuan Li, Zhiwei Chen
Publikováno v:
Frontiers in Immunology, Vol 13 (2022)
Lung adenocarcinoma (LUAD) is a primary cause of cancer-related death around the world and has a poor outcome and high incidence. Treatment options are, however, restricted. One of the most critical factors in cancer and metastasis is the N6-methylad
Externí odkaz:
https://doaj.org/article/1ed53b734d174783b58ef7c35d4f548d
Publikováno v:
Frontiers in Pharmacology, Vol 12 (2021)
With the increasing incidence of ulcerative colitis (UC) in China, Chinese medicinal herbs or relatively active compounds are widely applied in treating UC. These medicines may be combined with other therapeutic agents such as vitamin D3. Nevertheles
Externí odkaz:
https://doaj.org/article/f942152f263643298510639ec644d2ae
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 3, Pp 271-283 (2018)
A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, …, q such that the sums of the labels on the edges incident to each vertex are distinct. Hartsfield and Ringel conjectured that every connected graph other than
Externí odkaz:
https://doaj.org/article/d5c26d88a2954babbf79f02bd9d74d88
Publikováno v:
Sustainability; Volume 14; Issue 22; Pages: 14979
Public–private partnership (PPP) policy is essential to alleviating the local government debt burden and improving resource allocation efficiency. This paper empirically examines the impact of fiscal pressure on PPP investment in Chinese prefecture
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5ccc5b9e201c0c00fd1607971e07b3f
Autor:
Yingyu, Lu, Ting, Guan, Shuoxi, Xu, Yong-Er, Chen, Qi, Shen, Shumin, Zhu, Ying, Liu, Jian, Liang, Shaozhen, Hou
Publikováno v:
Phytomedicine. 101:154070
Asperuloside is a natural compound extracted from various herbs with several bioactivities. Its effects on anti-inflammation and anti-tumor indicated that asperuloside might prevent colorectal cancer developing from inflammatory bowel diseases (IBD).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9e0e84de9e07836c69566a82cd67d65
https://doi.org/10.1016/j.phymed.2022.154070
https://doi.org/10.1016/j.phymed.2022.154070
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 3, Pp 271-283 (2018)
A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, … , q such that the sums of the labels on the edges incident to each vertex are distinct. Hartsfield and Ringel conjectured that every connected graph other tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00945202d43e0d7964a7c982b4b26941
http://www.sciencedirect.com/science/article/pii/S0972860017301846
http://www.sciencedirect.com/science/article/pii/S0972860017301846
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 3, Pp 271-283 (2018)
A graph with edges is called if its edges can be labeled with 1, 2, , such that the sums of the labels on the edges incident to each vertex are distinct. Hartsfield and Ringel conjectured that every connected graph other than is antimagic. In this pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doajarticles::f136991eb9a2b9a9b27382e03f5f6d66
https://doaj.org/article/b0c371234e194e57a445d48d527a085c
https://doaj.org/article/b0c371234e194e57a445d48d527a085c
Publikováno v:
Mathematics in Computer Science. 12:77-90
A labeling f of a graph G is a bijection from its edge set E(G) to the set $$\{1, 2, \ldots , |E(G)|\}$$ , which is antimagic if the vertex-sums are pairwise distinct, where the vertex-sum at one vertex is the sum of labels of all edges incident to s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6934f0122aa86ef1ab0057c5c0c8635b
https://doi.org/10.1007/s11786-017-0327-z
https://doi.org/10.1007/s11786-017-0327-z