| 2007 |
| 10 | EE | 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 |
| 2006 |
| 9 | EE | Jeong Seop Sim,
Soo-Jun Park:
Transcription Factor Binding Sites Prediction Based on Sequence Similarity.
FSKD 2006: 1058-1061 |
| 2005 |
| 8 | EE | Jeong Seop Sim:
Time and Space Efficient Search for Small Alphabets with Suffix Arrays.
FSKD (1) 2005: 1102-1107 |
| 7 | EE | 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 |
| 6 | EE | 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) |
| 5 | | 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) |
| 2003 |
| 4 | EE | Dong Kyue Kim,
Jeong Seop Sim,
Heejin Park,
Kunsoo Park:
Linear-Time Construction of Suffix Arrays.
CPM 2003: 186-199 |
| 3 | EE | Jeong Seop Sim,
Kunsoo Park:
The consensus string problem for a metric is NP-complete.
J. Discrete Algorithms 1(1): 111-117 (2003) |
| 2001 |
| 2 | EE | Jeong Seop Sim,
Costas S. Iliopoulos,
Kunsoo Park,
William F. Smyth:
Approximate periods of strings.
Theor. Comput. Sci. 262(1): 557-568 (2001) |
| 1999 |
| 1 | EE | Jeong Seop Sim,
Costas S. Iliopoulos,
Kunsoo Park,
William F. Smyth:
Approximate Periods of Strings.
CPM 1999: 123-133 |