Zobrazeno 1 - 10
of 285
pro vyhledávání: '"Y.-L. Chin"'
High-throughput sequencing and functional genomics technologies have given us the human genome sequence as well as those of other experimentally, medically, and agriculturally important species, and have enabled large-scale genotyping and gene expres
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theoretical Computer Science. 821:15-22
Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must assign some amount of bundles to each buyer with respect to the buyer's acc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86a3af81f1952024540851c66652bfeb
https://doi.org/10.1016/j.tcs.2020.03.017
https://doi.org/10.1016/j.tcs.2020.03.017
Publikováno v:
PLoS ONE, Vol 10, Iss 9, p e0136264 (2015)
The problem of finding k-edge-connected components is a fundamental problem in computer science. Given a graph G = (V, E), the problem is to partition the vertex set V into {V1, V2,…, Vh}, where each Vi is maximized, such that for any two vertices
Externí odkaz:
https://doaj.org/article/1835cb1ca3cd4b28865a9c844ff0f6af
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
PLoS ONE, Vol 9, Iss 12, p e114253 (2014)
Since the read lengths of high throughput sequencing (HTS) technologies are short, de novo assembly which plays significant roles in many applications remains a great challenge. Most of the state-of-the-art approaches base on de Bruijn graph strategy
Externí odkaz:
https://doaj.org/article/9ae0690a65ad42599be3f01b62fd6379
In this paper we address the constrained longest common subsequence problem. Given two sequences $X$, $Y$ and a constrained sequence $P$, a sequence $Z$ is a constrained longest common subsequence for $X$ and $Y$ with respect to $P$ if $Z$ is the lon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::545ed609c11bd14ca2dbd6c7e8178049
Autor:
Khawn D. Tawng, Meng Kang Wong, Bin Tean Teh, Ah Moy Tan, Amos Hong Pheng Loh, Visveswari Ganesan, Shui Yen Soh, Francis Y. L. Chin, Mei Yoke Chan, Elizabeth Wagner, Benjamin N. Loke, Derrick W. Q. Lian, Sudhanshi Jain, York Tien Lee, Kenneth Tou En Chang, Chick Hong Kuick, Siam Wee Sim, Yuhan Zou
Publikováno v:
International Journal of Cancer. 144:1234-1242
Wilms tumor demonstrates significant interethnic epidemiological, histological and outcome differences, and is rare and poorly studied among Asians. We compared the clinicopathological, and loss of heterozygosity (LOH) profile and survival outcomes o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d97cb7f37cd8d256444abef29fc8bb9
https://doi.org/10.1002/ijc.31946
https://doi.org/10.1002/ijc.31946
Publikováno v:
Mathematical Foundations of Computing. 1:383-392
In the one-way trading problem, a seller has some product to be sold to a sequence of buyers in an online fashion, i.e., buyers come one after another. Each buyer has the accepted unit price which is known to the seller on his arrival. To maximize th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c4b4bdac6d155057be44e838ba85e82
https://doi.org/10.3934/mfc.2018019
https://doi.org/10.3934/mfc.2018019
Publikováno v:
International Journal of Reconfigurable Computing, Vol 2008 (2008)
We investigate the power and energy implications of using embedded FPGA memory blocks to implement logic. Previous studies have shown that this technique provides extremely dense implementations of some types of logic circuits, however, these previou
Externí odkaz:
https://doaj.org/article/c86d798df2284f129a7c11977ee72e56