default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoong Chae Na
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Youngho Kim
, Munseong Kang, Joong Chae Na, Jeong Seop Sim:
Order-preserving pattern matching with scaling. Inf. Process. Lett. 180: 106333 (2023)- [j23]Yongsik Kwon, Seonho Lee, Yehyun Nam, Joong Chae Na, Kunsoo Park, Sang K. Cha, Bongki Moon:
DB+-tree: A new variant of B+-tree for main-memory database systems. Inf. Syst. 119: 102287 (2023)
2010 – 2019
- 2019
- [j22]Joong Chae Na, Inbok Lee, Je-Keun Rhee, Soo-Yong Shin:
Fast single individual haplotyping method using GPGPU. Comput. Biol. Medicine 113 (2019) - [j21]Joong Chae Na, Inbok Lee:
A Simple Heuristic for Order-Preserving Matching. IEICE Trans. Inf. Syst. 102-D(3): 502-504 (2019) - 2018
- [j20]Joong Chae Na, Jongchan Lee, Je-Keun Rhee, Soo-Yong Shin:
PEATH: single-individual haplotyping by a probabilistic evolutionary algorithm with toggling. Bioinform. 34(11): 1801-1807 (2018) - [j19]Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
An O(n2logm)-time algorithm for the boxed-mesh permutation pattern matching problem. Theor. Comput. Sci. 710: 35-43 (2018) - [j18]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment with gaps. Theor. Comput. Sci. 710: 148-157 (2018) - 2017
- [j17]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. Math. Comput. Sci. 11(2): 127-136 (2017) - 2016
- [j16]Joong Chae Na, Hyunjoon Kim, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment: A compressed index for similar strings. Theor. Comput. Sci. 638: 159-170 (2016) - [j15]Youngho Kim, Joong Chae Na, Heejin Park, Jeong Seop Sim:
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm. Theor. Comput. Sci. 656: 173-179 (2016) - [r2]Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park:
Indexed Two-Dimensional String Matching. Encyclopedia of Algorithms 2016: 973-977 - [i2]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of Alignment with Gaps. CoRR abs/1606.03897 (2016) - 2015
- [j14]Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115(2): 397-402 (2015) - [c18]Cheong-mok Bae, Eun Kwang Kim, Jongchan Lee, Kyung-Joong Kim, Joong Chae Na:
Generation of an arbitrary shaped large maze by assembling mazes. CIG 2015: 538-539 - [c17]Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem. CPM 2015: 138-148 - 2014
- [c16]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. ICABD 2014: 46-52 - 2013
- [j13]Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding consensus and optimal alignment of circular strings. Theor. Comput. Sci. 468: 92-101 (2013) - [c15]Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
Fast Order-Preserving Pattern Matching. COCOA 2013: 295-305 - [c14]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA 2013: 337-348 - [c13]Joong Chae Na, Heejin Park, Sunho Lee, Minsung Hong, Thierry Lecroq, Laurent Mouchard, Kunsoo Park:
Suffix Array of Alignment: A Practical Index for Similar Data. SPIRE 2013: 243-254 - [i1]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. CoRR abs/1305.1744 (2013) - 2012
- [j12]Kyung-Joong Kim, Jun-Ho Seo, Jung Guk Park, Joong Chae Na:
Generalization of TORCS car racing controllers with artificial neural networks and linear regression analysis. Neurocomputing 88: 87-99 (2012) - 2011
- [j11]Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
Linear-Time Construction of Two-Dimensional Suffix Trees. Algorithmica 59(2): 269-297 (2011) - [j10]Taehyung Lee, Joong Chae Na, Kunsoo Park:
On-line construction of parameterized suffix trees for large alphabets. Inf. Process. Lett. 111(5): 201-207 (2011) - [j9]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011) - [c12]Seung Gu Kang, Hong Jun Choi, Cheol Hong Kim, Sung Woo Chung, Dongseop Kwon, Joong Chae Na:
Exploration of CPU/GPU co-execution: from the perspective of performance, energy, and temperature. RACS 2011: 38-43 - 2010
- [c11]Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding Optimal Alignment and Consensus of Circular Strings. CPM 2010: 310-322
2000 – 2009
- 2009
- [j8]Joong Chae Na, Ji Eun Kim, Kunsoo Park, Dong Kyue Kim:
Fast Computation of Rank and Select Functions for Succinct Representation. IEICE Trans. Inf. Syst. 92-D(10): 2025-2033 (2009) - [j7]Joong Chae Na, Kangho Roh, Alberto Apostolico, Kunsoo Park:
Alignment of biological sequences with quality scores. Int. J. Bioinform. Res. Appl. 5(1): 97-113 (2009) - [j6]Joong Chae Na, Namhee Kim, Jeong Seop Sim, Dong Kyue Kim:
Improving on-line construction of two-dimensional suffix trees for square matrices. Inf. Process. Lett. 109(10): 504-508 (2009) - [j5]Joong Chae Na, Dong Kyue Kim, Jeong Seop Sim:
Finding the longest common nonsuperstring in linear time. Inf. Process. Lett. 109(18): 1066-1070 (2009) - [j4]Zheng Wu, Joong Chae Na, Minhwan Kim, Dong Kyue Kim:
Improving Lookup Time Complexity of Compressed Suffix Arrays using Multi-ary Wavelet Tree. J. Comput. Sci. Eng. 3(1): 1-14 (2009) - [c10]Jin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim:
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model. ISAAC 2009: 1185-1194 - [c9]Taehyung Lee, Joong Chae Na, Kunsoo Park:
On-Line Construction of Parameterized Suffix Trees. SPIRE 2009: 31-38 - [c8]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242 - 2008
- [r1]Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park:
Two-Dimensional Pattern Indexing. Encyclopedia of Algorithms 2008 - 2007
- [j3]Joong Chae Na, Raffaele Giancarlo, Kunsoo Park:
On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time. Algorithmica 48(2): 173-186 (2007) - [j2]Joong Chae Na, Kunsoo Park:
Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space. Theor. Comput. Sci. 385(1-3): 127-136 (2007) - [c7]Juha Kärkkäinen, Joong Chae Na:
Faster Filters for Approximate String Matching. ALENEX 2007 - [c6]Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. CPM 2007: 352-364 - 2005
- [c5]Joong Chae Na, Raffaele Giancarlo, Kunsoo Park:
O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees. COCOON 2005: 273-282 - [c4]Joong Chae Na:
Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. CPM 2005: 57-67 - [c3]Dong Kyue Kim, Joong Chae Na, Ji Eun Kim, Kunsoo Park:
Efficient Implementation of Rank and Select Functions for Succinct Representation. WEA 2005: 315-327 - 2004
- [c2]Joong Chae Na, Kunsoo Park:
Simple Implementation of String B-Trees.. SPIRE 2004: 214-215 - 2003
- [j1]Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park:
Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1-3): 87-101 (2003) - 2000
- [c1]Joong Chae Na, Kunsoo Park:
Data Compression with Truncated Suffix Trees. Data Compression Conference 2000: 565
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-04 03:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
