Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Donglei Du"'
Autor:
Xiu-Qing Li, Donglei Du
Publikováno v:
PLoS ONE, Vol 9, Iss 2, p e88339 (2014)
C+G content (GC content or G+C content) is known to be correlated with genome/chromosome size in bacteria but the relationship for other kingdoms remains unclear. This study analyzed genome size, chromosome size, and base composition in most of the a
Externí odkaz:
https://doaj.org/article/88878b19b8aa49f4844af0124bb7aecc
Autor:
Xiu-Qing Li, Donglei Du
Publikováno v:
PLoS ONE, Vol 8, Iss 11, p e79511 (2013)
Pre-messenger RNA (mRNA) 3'-end cleavage and subsequent polyadenylation strongly regulate gene expression. In comparison with the upstream or downstream motifs, relatively little is known about the feature differences of polyadenylation [poly(A)] sit
Externí odkaz:
https://doaj.org/article/3ed86decebaa4505a58552fd87a70ee7
Publikováno v:
PLoS ONE, Vol 7, Iss 9, p e44872 (2012)
Most protein PageRank studies do not use signal flow direction information in protein interactions because this information was not readily available in large protein databases until recently. Therefore, four questions have yet to be answered: A) Wha
Externí odkaz:
https://doaj.org/article/d504dccdcafb4a27ad255d2804904e0d
Publikováno v:
International Journal of Foundations of Computer Science. :1-15
Sparsest cut problems are very important graph partitions, which have been widely applied in expander graphs, Markov chains, and image segmentation. In this paper, we study the edge-weighted version of the Sparse Cut Problem, which minimizes the rati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6199a77ee324694ab56a15f9e9f44763
https://doi.org/10.1142/s0129054122460029
https://doi.org/10.1142/s0129054122460029
Publikováno v:
International Journal of Foundations of Computer Science. :1-12
We consider the scheduling game with activation cost, where jobs as selfish agents compete for processing on serial-batching identical machines. Each job selects a machine (more precisely, a batch on a machine) for processing to minimize his disutili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9b2dd584efea9dbbfbabfa9bf7064f1
https://doi.org/10.1142/s0129054122460078
https://doi.org/10.1142/s0129054122460078
Publikováno v:
Tsinghua Science and Technology. 27:777-784
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2c2c642a6091beaa218d33e809437d4
https://doi.org/10.26599/tst.2021.9010051
https://doi.org/10.26599/tst.2021.9010051
Publikováno v:
Theoretical Computer Science. 931:49-55
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::624e9e910c92e51ad57888de65e32e6e
https://doi.org/10.1016/j.tcs.2022.07.029
https://doi.org/10.1016/j.tcs.2022.07.029
Publikováno v:
Asia-Pacific Journal of Operational Research.
The set cover problem has been studied extensively for many years. Submodular function plays a key role in combinatorial optimization. Extending the set cover problem, we consider three submodular cover problems. The first two problems minimize linea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f96099524ad71067e7492c43dcdbfc5
https://doi.org/10.1142/s0217595923400122
https://doi.org/10.1142/s0217595923400122
Publikováno v:
Journal of Combinatorial Optimization. 45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8d56750714bf62449e04695c42b9ded
https://doi.org/10.1007/s10878-022-00978-4
https://doi.org/10.1007/s10878-022-00978-4
Publikováno v:
Journal of Combinatorial Optimization. 45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fed8fddc4f0401b1cfab203cc03c1c5
https://doi.org/10.1007/s10878-022-00976-6
https://doi.org/10.1007/s10878-022-00976-6