Approximate periods of strings. - Jeong Seop Sim; Costas S. Iliopoulos; Kunsoo Park; William F. Smyth (Theor. Comput. Sci., 2001)

Linear-Time Construction of Suffix Arrays. - Dong Kyue Kim; Jeong Seop Sim; Heejin Park; Kunsoo Park (CPM, 2003)

The consensus string problem for a metric is NP-complete. - Jeong Seop Sim; Kunsoo Park (J. Discrete Algorithms, 2003)

Time and Space Efficient Search for Small Alphabets with Suffix Arrays. - Jeong Seop Sim (FSKD (1), 2005)

Protein Structure Abstractionand Automatic Clustering Using Secondary Structure Element Sequences. - Sung-Hee Park; Chan Yong Park; Dae-Hee Kim; Seon Hee Park; Jeong Seop Sim (ICCSA (2), 2005)

Approximate Seeds of Strings. - Manolis Christodoulakis; Costas S. Iliopoulos; Kunsoo Park; Jeong Seop Sim (J. Autom. Lang. Comb., 2005)

Constructing suffix arrays in linear time. - Dong Kyue Kim; Jeong Seop Sim; Heejin Park; Kunsoo Park (J. Discrete Algorithms, 2005)

Implementing approximate regularities. - Manolis Christodoulakis; Costas S. Iliopoulos; Kunsoo Park; Jeong Seop Sim (Math. Comput. Model., 2005)

Transcription Factor Binding Sites Prediction Based on Sequence Similarity. - Jeong Seop Sim; Soo-Jun Park (FSKD, 2006)

A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. - Dong Kyue Kim; Joong Chae Na; Jeong Seop Sim; Kunsoo Park (CPM, 2007)

Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model. - Jin Wook Kim; Siwon Choi; Joong Chae Na; Jeong Seop Sim (ISAAC, 2009)

Consensus Optimizing Both Distance Sum and Radius. - Amihood Amir; Gad M. Landau; Joong Chae Na; Heejin Park; Kunsoo Park; Jeong Seop Sim (SPIRE, 2009)

Finding the longest common nonsuperstring in linear time. - Joong Chae Na; Dong Kyue Kim; Jeong Seop Sim (Inf. Process. Lett., 2009)

Improving on-line construction of two-dimensional suffix trees for square matrices. - Joong Chae Na; Namhee Kim; Jeong Seop Sim; Dong Kyue Kim (Inf. Process. Lett., 2009)

Finding Optimal Alignment and Consensus of Circular Strings. - Taehyung Lee 002; Joong Chae Na; Heejin Park; Kunsoo Park; Jeong Seop Sim (CPM, 2010)

Reducing disk power consumption in portable media players. - Minseok Song 002; Wanhyung Ryu; Jeong Seop Sim (ESTIMedia, 2010)

Linear-Time Construction of Two-Dimensional Suffix Trees. - Dong Kyue Kim; Joong Chae Na; Jeong Seop Sim; Kunsoo Park (Algorithmica, 2011)

Efficient algorithms for consensus string problems minimizing both distance sum and radius. - Amihood Amir; Gad M. Landau; Joong Chae Na; Heejin Park; Kunsoo Park; Jeong Seop Sim (Theor. Comput. Sci., 2011)

Fast Order-Preserving Pattern Matching. - Sukhyeun Cho; Joong Chae Na; Kunsoo Park; Jeong Seop Sim (COCOA, 2013)

Finding consensus and optimal alignment of circular strings. - Taehyung Lee 002; Joong Chae Na; Heejin Park; Kunsoo Park; Jeong Seop Sim (Theor. Comput. Sci., 2013)

Balancing disk energy against reliability in video playback. - Minseok Song 002; Wanhyung Ryu; Jeong Seop Sim; Yeongju Lee (Multim. Syst., 2014)

Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem. - Sukhyeun Cho; Joong Chae Na; Jeong Seop Sim (CPM, 2015)

Fast Multiple Order-Preserving Matching Algorithms. - Myoungji Han; Munseong Kang; Sukhyeun Cho; Geonmo Gu; Jeong Seop Sim; Kunsoo Park (IWOCA, 2015)

A fast algorithm for order-preserving pattern matching. - Sukhyeun Cho; Joong Chae Na; Kunsoo Park; Jeong Seop Sim (Inf. Process. Lett., 2015)

A simple proof of optimality for the MIN cache replacement policy. - Mun-Kyu Lee; Pierre Michaud; Jeong Seop Sim; DaeHun Nyang (Inf. Process. Lett., 2016)

A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm. - Youngho Kim; Joong Chae Na; Heejin Park; Jeong Seop Sim (Theor. Comput. Sci., 2016)

A power- and storage-efficient HLS media server for multi-bitrate VOD services. - Sungchan Hur; Sukhyeun Cho; Youngho Kim; Jeong Seop Sim (BigComp, 2017)

On Representations of Ternary Order Relations in Numeric Strings. - Jinil Kim; Amihood Amir; Joong Chae Na; Kunsoo Park; Jeong Seop Sim (Math. Comput. Sci., 2017)

An O(n2log⁡m)-time algorithm for the boxed-mesh permutation pattern matching problem. - Sukhyeun Cho; Joong Chae Na; Jeong Seop Sim (Theor. Comput. Sci., 2018)

Order-preserving pattern matching with scaling. - Youngho Kim; Munseong Kang; Joong Chae Na; Jeong Seop Sim (Inf. Process. Lett., 2023)