Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Jia-Jie Liu"'
Autor:
Yousif Abdelrahman Yousif Abdellah, Hong-Yu Chen, Shi-Wen Deng, Wan-Ting Li, Rong-Jie Ren, Xi Yang, Muhammad Shoaib Rana, Shan-Shan Sun, Jia-Jie Liu, Rui-Long Wang
Publikováno v:
Biochar, Vol 6, Iss 1, Pp 1-21 (2024)
Abstract Biochar can potentially reduce heavy metals (HMs) mobility and bioavailability during composting. However, siderophores secreted by functional microbes might lead to the re-mobilization of metals like Cu and Zn. Therefore, this study intende
Externí odkaz:
https://doaj.org/article/745f702a15c54f4c8a951106321d1e1f
Autor:
Jia-Jie Liu, 劉嘉傑
96
Measuring the similarity or difference between two strings is fundamental to many applications. In bioinformatics, one has to predict the structures of RNA and proteins, to classify the functions of molecules, to infer the phylogeny of organi
Measuring the similarity or difference between two strings is fundamental to many applications. In bioinformatics, one has to predict the structures of RNA and proteins, to classify the functions of molecules, to infer the phylogeny of organi
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/70786339794335859685
Publikováno v:
Discrete Applied Mathematics. 311:68-71
Publikováno v:
International Journal of Foundations of Computer Science. 33:141-148
In this paper, we introduce a new variant of domination called the outer-paired domination. For a graph [Formula: see text], an outer-paired dominating set [Formula: see text] is a dominating set of [Formula: see text] such that the induced subgraph
Publikováno v:
Discrete Applied Mathematics. 260:289-293
In [Secure domination in proper interval graphs, Discrete Applied Mathematics 247 (2018) 70–76], Araki and Miyazaki proposed a linear-time algorithm for finding the secure domination number of proper interval graphs. However, the example they provi
Publikováno v:
Theory of Computing Systems. 61:893-906
Let G(V, E) be a connected and undirected graph with n-vertex-set V and m-edge-set E. For each v ∈ V, let N(v) = {u|v ∈ V and(u, v) ∈ E}. For a positive integer k, a k-rainbow dominating function of a graph G is a function f from V(G) to a k-bi
Autor:
Shuang Zhao, Zhi-Jie Li, Hua-Chuan Zheng, Gui-Feng Zhao, Xiao-Qing Ding, Xue-Wen Yu, Ke-Qiang Huang, Hao-Yu He, Jia-Jie Liu, Ji-Cheng Wu
Publikováno v:
Oncotarget
// Gui-Feng Zhao 1 , Shuang Zhao 1 , Jia-Jie Liu 1 , Ji-Cheng Wu 1 , Hao-Yu He 1 , Xiao-Qing Ding 1 , Xue-Wen Yu 2 , Ke-Qiang Huang 2 , Zhi-Jie Li 1 , Hua-Chuan Zheng 1 1 Department of Experimental Oncology and Animal Center, Shengjing Hospital of Ch
Autor:
Shuang Zhao, Jia-jie Liu, Hua-chuan Zheng, Zhi-Juan Zhao, Xianghong Yang, Yang Gao, Ke-Qiang Huang, Shuai Shi, Xue-feng Yang
Publikováno v:
Oncotarget
// Xue-feng Yang 1 , Zhi-juan Zhao 1 , Jia-jie Liu 1 , Xiang-hong Yang 2 , Yang Gao 1 , Shuang Zhao 1 , Shuai Shi 1 , Ke-qiang Huang 3 , Hua-chuan Zheng 1, 4 1 Cancer Center, The First Affiliated Hospital of Jinzhou Medical University, Jinzhou 121001
Autor:
Yang Gao, Ji-feng Zhang, Qing-chang Li, Jia-jie Liu, Li-li Liu, Xue-feng Yang, Hua-mao Jiang, Hua-chuan Zheng
Publikováno v:
Oncotarget
// Yang Gao 1, * , Ji-feng Zhang 1, * , Qing-chang Li 2 , Jia-jie Liu 1 , Li-li Liu 1 , Xue-feng Yang 1 , Hua-mao Jiang 3 , Hua-chuan Zheng 1, 4 1 Cancer Center, Key Laboratory of Brain and Spinal Cord Injury of Liaoning Province, and Animal Center,
Publikováno v:
Information Processing Letters. 115:917-922
The outer-connected domination problem is abbreviated as the OCD problem.The OCD problem was known to be linear-time solvable on proper interval graphs.We solve the OCD problem on interval graphs in linear-time.We do so by developing a chainless deco