Jeong Seop Sim

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)

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)

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)

Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim: Finding Optimal Alignment and Consensus of Circular Strings. CPM 2010: 310-322

Minseok Song, Wanhyung Ryu, Jeong Seop Sim: Reducing disk power consumption in portable media players. ESTImedia 2010: 81-89

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)

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)

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

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

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

Jeong Seop Sim, Soo-Jun Park: Transcription Factor Binding Sites Prediction Based on Sequence Similarity. FSKD 2006: 1058-1061

Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim: Approximate Seeds of Strings. Journal of Automata, Languages and Combinatorics 10(5/6): 609-626 (2005)

Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park: Constructing suffix arrays in linear time. J. Discrete Algorithms 3(2-4): 126-142 (2005)

Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim: Implementing approximate regularities. Mathematical and Computer Modelling 42(7-8): 855-866 (2005)

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

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

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

Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park: Linear-Time Construction of Suffix Arrays. CPM 2003: 186-199

Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim: Approximate Seeds of Strings. Stringology 2003: 25-36

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

Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate Periods of Strings. CPM 1999: 123-133