Zobrazeno 1 - 10 of 226 pro vyhledávání: '"Kunsoo Park"'
1
RDscan: A New Method for Improving Germline and Somatic Variant Calling Based on Read Depth Distribution
Autor: Sunho Lee, Seokchol Hong, Jonathan Woo, Jae-hak Lee, Kyunghee Kim, Lucia Kim, Kunsoo Park, Jongsun Jung
Publikováno v: Journal of Computational Biology. 29:987-1000
Several tools have been developed for calling variants from next-generation sequencing (NGS) data. Although they are generally accurate and reliable, most of them have room for improvement, especially regarding calling variants in datasets with low r
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf74ce30292662c648ff9487e6dbf36c
https://doi.org/10.1089/cmb.2021.0269
Zobrazit plný text záznamu
2
Index Key Compression and On-the-Fly Reconstruction of In-Memory Indexes
Autor: Yongsik Kwon, Cheol Ryu, Sang Kyun Cha, Arthur H. Lee, Kunsoo Park, Bongki Moon
Publikováno v: Journal of Database Management. 33:1-17
This article proposes an index key compression scheme based on the notion of distinction bits. It proves that the distinction bits of index keys are sufficient information to determine the sorted order of the index keys. The actual compression ratio
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4dd974f71746564102ec0b8765e8100c
https://doi.org/10.4018/jdm.305732
Zobrazit plný text záznamu
5
On the Longest Common Cartesian Substring Problem
Autor: Simone Faro, Thierry Lecroq, Kunsoo Park, Stefano Scafiti
A Cartesian tree is associated with a string of numbers and is structured as a heap from which the original string can be recovered. Although Cartesian trees have been introduced 40 years ago, the Cartesian tree matching problem appeared very recentl
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e084cb60e858d0e1343358c7e8f4a80
https://hdl.handle.net/20.500.11769/558844
Zobrazit plný text záznamu
8
Finding patterns and periods in Cartesian tree matching
Autor: Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park
Publikováno v: Theoretical Computer Science. 845:181-197
We introduce a new metric of match, called Cartesian tree matching, which means that two strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we define single pattern matching, multiple pattern matching, and indexing
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e6c101ef8e02040c5bf83fd624ab1c2f
https://doi.org/10.1016/j.tcs.2020.09.014
Zobrazit plný text záznamu
9
IDAR
Autor: Hyunjoon Kim, Xuemin Lin, Seunghwan Min, Wook-Shin Han, Seok-Hee Hong, Kunsoo Park
Publikováno v: Proceedings of the VLDB Endowment. 13:1456-1468
Supergraph search is one of fundamental graph query processing problems in many application domains. Given a query graph and a set of data graphs, supergraph search is to find all the data graphs contained in the query graph as subgraphs. In existing
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2feb4d84c74194416f0e8817eaaff24e
https://doi.org/10.14778/3397230.3397241
Zobrazit plný text záznamu
10
Fast string matching for DNA sequences
Autor: Thierry Lecroq, Kunsoo Park, Cheol Ryu
Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, ⟨10.1016/j.tcs.2019.09.031⟩
In this paper we propose the Maximal Average Shift (MAS) algorithm that finds a pattern scan order that maximizes the average shift length. We also present two extensions of MAS: one improves the scan speed of MAS by using the scan result of the prev
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cabce3a2ac90626515d1c2e962c5a659
https://doi.org/10.1016/j.tcs.2019.09.031
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje