Computer Theory and Application Laboratory

International Journal Papers

International Journal Papers

  • J. Lim and K. Park,
    A fast algorithm for the all-pairs suffix-prefix problem,
    Theoretical Computer Science 698 (2017), 14-24(Oct 2017)
  • J. Kim, A. Amir, J.C. Na, K. Park, and J.S. Sim,
    On Representations of Ternary Order Relations in Numeric Strings,
    Mathematics in Computer Science (2017), 11:127-136(May 2017)
  • J.C. Na, H. Kim, H. Park, T. Lecroq, M. Leonard, L. Mouchard, and K. Park,
    FM-index of alignment: a compressed index for similar strings,
    Theoretical Computer Science 638 (2016), 159-170(SCI, July 2016)
  • Jung Woo Kim, Jungjoo Seo, Jin Hong, Kunsoo Park, and Sung-Ryul Kim,
    High-speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system,
    Software-Practice and Experience, 45 (2015), 837-855(SCIE, June 2015)
  • Jungjoo Seo, Myoungji Han, and Kunsoo Park,
    Efficient Accessing and Searching in a Sequence of Numbers,
    Journal of Computing Science and Engineering, 9, 1 (2015), 1-8(March 2015)
  • Sukhyeon Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim,
    A fast algorithm for order-preserving pattern matching,
    Information Processing Letters 115, 2 (2015), 397-402(SCIE, Feb 2015)
  • Sang K. Cha, Kunsoo Park, Changbin Song, Kihong Kim, Cheol Ryu, and Sunho Lee,
    Interval disaggregate: a new operator for business planning,
    Proceedings of the VLDB Endowment, Vol.7 No.13 (August 2014), 1381-1392. SCOPUS
  • J.C. Na, S. Cho, S. Choi, J.W. Kim, K. Park and J.S. Sim,
    A new graph model and algorithms for consistent superstring problems,
    Philosophical Transactions of the Royal Society A 372 (May 2014). SCI
  • Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis,
    Extending alignments with k-mismatches and l-gaps,
    Theor. Comput. Sci. 525 (March 2014), 80-88. SCI
  • J. Kim, P. Eades, R. Fleischer, S.H. Hong, C.S. Iliopoulos, K. Park, S.J. Puglisi, and T. Tokuyama,
    Order-preserving matching,
    Theoretical Computer Science, 525 (March 2014), 68-79. SCI
  • J. Hong, J.W. Kim, J. Kim, K. Park and J.H. Cheon,
    Constant-round privacy preserving multiset union,
    Bull. Korean Math. Soc. 50 (November 2013), 1799-1816. SCIE
  • T. Flouri, K. Frousios, C.S. Iliopoulos, K. Park, S.P. Pissis and G. Tischler,
    GapMis: a tool for pairwise sequence alignment with a single gap,
    Recent Patents on DNA & Gene Sequences, 7, 2 (July 2013), 84-95. SCOPUS
  • M.K. Lee, J.W. Kim, J.E. Song and K. Park,
    Efficient implementation of NTRU cryptosystem using sliding window methods,
    IEICE Trans. Fundamentals, vol.E96-A,1 (January 2013), 206-214. SCIE
  • Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim,
    Finding consensus and optimal alignment of circular strings,
    Theoretical Computer Science 468 (January 2013), 92-101. SCI
  • Jin Wook Kim, Sunho Lee, Kunsoo Park, Seungjin Na, Eunok Paek, Hyung Seo Park, Heejin Park, Kong-Joo Lee, Jaeho Jeong, Hwa-Young Kim,
    Monoisotopic Mass Determination Algorithm for Selenocysteine-Containing Polypeptides from Mass Spectrometric Data Based on Theoretical Modeling of Isotopic Peak Intensity Ratios,
    Journal of Proteome Research. (2012)SCI
  • A. Amir, G.M. Landau, J.C. Na, H. Park, K. Park and J.S. Sim,
    Efficient algorithms for consensus string problems minimizing both distance sum and radius,
    THEORETICAL COMPUTER SCIENCE, 412, 39 (2011), 5239-5246. SCI
  • T. Lee, J.C. Na and K. Park,
    On-line construction of parameterized suffix trees for large alphabets,
    Information Processing Letters, 111 (2011), 201-207. SCIE
  • D.K. Kim, J.C. Na, J.S. Sim and K. Park,
    Linear-time construction of two-dimensional suffix trees,
    Algorithmica 59 (2011), 269-297. SCI
  • J.Y. Yoon, J. Yeom, H. Lee, K. Kim, S. Na, K. Park, E. Paek, and C. Lee,
    High-throughput peptide quantification using mTRAQ reagent triplex,
    BMC Bioinformatics (2011), 12(S1): S46. SCIE
  • J. Hong, J. Kim, J. Kim, M.K. Franklin and K. Park,
    Fair threshold decryption with semi-trusted third parties,
    Int. J. Applied Cryptography 2, 2 (2010), 139-153.
  • J.Y. Yoon, K.Y. Lim, S. Lee, K. Park, E. Paek, U.B. Kang, J. Yeom, C. Lee,
    Improved quantitative analysis of mass spectrometry using quadratic equations,
    Journal of Proteome Research 9, 5 (2010), 2775-2785. SCI
  • J.C. Na, J.E. Kim, K. Park, and D.K. Kim,
    Fast computation of rank and select functions for succinct representation,
    IEICE Transactions on Information and Systems Vol.E92-D No.10 (2009), 2025-2033. SCIE
  • S. Lee and K. Park,
    Dynamic rank/select structures with applications to run-length encoded texts,
    Theoretical Computer Science 410, 43 (2009), 4402-4413. SCI
  • S. Lee and K. Park,
    Dynamic compressed representation of texts with rank/select,
    Journal of Computing Science and Engineering 3, 1 (2009), 15-26.
  • K. Park, H. Park, W.C. Jeun and S. Ha,
    Boolean circuit programming: a new paradigm to design parallel algorithms,
    Journal of Discrete Algorithms 7 (2009), 267-277.
  • E. Kim and K. Park,
    Improving multikey quicksort for sorting strings with many equal elements,
    Information Processing Letters 109 (2009), 454-459. SCIE
  • J.C. Na, K. Roh, A. Apostolico and K. Park
    Alignment of biological sequences with quality scores,
    International Journal of Bioinformatics Research and Applications 5, 1 (2009), 97-113.
  • K. Park, J.Y. Yoon, S. Lee, E. Paek, H. Park, H.J. Jung and S.W. Lee,
    Isotopic peak intensity ratio based algorithm for determination of isotopic clusters and monoisotopic masses of polypeptides from high-resolution mass spectrometric data,
    Analytical Chemistry 80, 19 (2008), 7294-7303. SCI
  • J.W. Kim, A. Amir, G.M. Landau and K. Park,
    Computing similarity of run-length encoded strings with affine gap penalty,
    Theoretical Computer Science 395 (2008), 268-282. SCI
  • E. Kim, L. Xiao, K. Nahrstedt and K. Park,
    Secure interdomain routing registry,
    IEEE Transactions on Information Forensics and Security 3, 2 (2008), 304-316. SCIE
  • E. Park and K. Park,
    An improved boolean circuit for maximum matching in a convex bipartite graph,
    Fundamenta Informaticae 84, 1 (2008), 81-97. SCIE
  • K. Roh, M. Crochemore, C.S. Iliopoulos and K. Park
    External memory algorithms for string problems,
    Fundamenta Informaticae 84, 1 (2008), 17-32. SCIE
  • J.C. Na and K. Park,
    Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space,
    Theoretical Computer Science 385 (2007), 127-136. SCI
  • J.C. Na, R. Giancarlo, and K. Park,
    On-line construction of two-dimensional suffix trees in O(n^2 log n) time,
    Algorithmica 48 (2007), 173-186. SCI
  • I. Lee, C.S. Iliopoulos, and K. Park,
    Linear time algorithm for the longest common repeat problem,
    Journal of Discrete Algorithms 5, 2 (2007), 243-249.
  • J.W. Kim and K. Park,
    An efficient alignment algorithm for masked sequences,
    Theoretical Computer Science 370 (2007), 19-33. SCI
  • J.W. Kim, K.H. Roh, K. Park, H. Park, J.S. Seo,
    MLP: mate-based sequence layout with Phrap,
    Bioinformatics and Biosystems 1, 1 (2006), 61-66.
  • S.G. Park, T. Lee, H.Y. Kang, K. Park, K.H. Cho and G. Jung,
    The influence of the signal dynamics of activated form of IKK on NF-kB and anti-apoptotic gene expressions: A systems biology approach,
    FEBS Letters 580 (2006), 822-830. SCI
  • M. Christodoulakis, C.S. Iliopoulos, K. Park and J.S. Sim,
    Approximate seeds of strings,
    Journal of Automata, Languages and Combinatorics 10, 5-6 (2005), 609-626.
  • T.J. Park, M.K. Lee, K. Park and K.I. Chung,
    Speeding up scalar multiplication in genus 2 hyperelliptic curves with efficient endomorphisms,
    ETRI Journal 27, 5 (2005), 617-627. SCI
  • M. Christodoulakis, C.S. Iliopoulos, K. Park and J.S. Sim,
    Implementing approximate regularities,
    Mathematical and Computer Modelling 42, 7-8 (2005), 855-866. SCIE
  • D.K. Kim, J.S. Sim, H. Park and K. Park,
    Constructing suffix arrays in linear time,
    Journal of Discrete Algorithms 3 (2005), 126-142.
  • M.K. Lee, Y. Kim, K. Park and Y. Cho,
    Efficient parallel exponentiation in GF(q^n) using normal basis representations,
    Journal of Algorithms 54, 2 (2005), 205-221. SCI
  • Z. Galil, J.G. Park and K. Park,
    Three-dimensional periodicity and its application to pattern matching,
    SIAM Journal on Discrete Mathematics 18, 2 (2004), 362-381. SCI
  • H. Park, K. Park and Y. Cho,
    Deleting keys of B-trees in parallel,
    Journal of Parallel and Distributed Computing 64 (2004), 1041-1050. SCI
  • S.R. Kim, I. Lee and K. Park,
    A fast algorithm for the generalized k-keyword proximity problem given keyword offsets,
    Information Processing Letters 91, 3 (2004), 115-120. SCIE
  • S.R. Kim and K. Park,
    A dynamic edit distance table,
    Journal of Discrete Algorithms 2, 2 (2004), 303-312.
  • R. Cole, Z. Galil, R. Hariharan, S. Muthukrishnan and K. Park,
    Parallel two dimensional witness computation,
    Information and Computation 188, 1 (2004), 20-67. SCI
  • S. Kim, J.S. Sim, H. Park, K. Park, H. Park and J.S. Seo,
    A heuristic algorithm to find all normalized local alignments above a threshold,
    Genomics & Informatics 1, 1 (2003), 25-31.
  • Y. Chung and K. Park,
    An efficient parallel algorithm for scheduling interval ordered tasks,
    Journal of Complexity 19, 4 (2003), 597-609. SCI
  • J.C. Na, A. Apostolico, C.S. Iliopoulos and K. Park,
    Truncated suffix trees and their application to data compression,
    Theoretical Computer Science 304 (2003), 87-101. SCI
  • I. Lee, K. Park, S.K. Chung and Y. Choi,
    A simple and scalable algorithm for the IP address lookup problem,
    Fundamenta Informaticae 56, 1-2 (2003), 181-190. SCIE
  • D.K. Kim, Y.A. Kim and K. Park,
    Generalizations of suffix arrays to multi-dimensional matrices,
    Theoretical Computer Science 302 (2003), 223-238. SCI
  • M.K. Lee and K. Park,
    Efficient arithmetic in optimal extension fields using simultaneous multiplication,
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science vol.E86-A, 5 (2003), 1316-1321.SCIE
  • J.S Sim and K. Park,
    The consensus string problem for a metric is NP-complete,
    Journal of Discrete Algorithms 1 (2003), 111-117.
  • J.S. Sim, C.S. Iliopoulos, K. Park and W.F. Smyth,
    Approximate periods of strings,
    Theoretical Computer Science 262 (2001), 557-568. SCI
  • H. Park and K. Park,
    Parallel algorithms for red-black trees,
    Theoretical Computer Science 262 (2001), 415-435. SCI
  • S.R. Kim and K. Park,
    Fully scalable fault-tolerant simulations for BSP and CGM,
    Journal of Parallel and Distributed Computing 60, 12 (2000), 1531-1560. SCI
  • H. Park, K. Park and Y. Cho,
    Analysis of the variable length nonzero window method for exponentiation,
    Computers & Mathematics with Applications 37, 7 (1999), 21-29. SCI
  • Y. Chung, K. Park and Y. Cho,
    Parallel maximum matching algorithms in interval graphs,
    International Journal of Foundations of Computer Science 10, 1 (1999), 47-60.
  • D.K. Kim, J.S. Lee, K. Park and Y. Cho
    Efficient algorithms for approximate string matching with swaps,
    Journal of Complexity 15 (1999), 128-147. SCI
  • K. Park,
    Analysis of two-dimensional approximate pattern matching algorithms,
    Theoretical Computer Science 201 (1998), 263-273. SCI
  • K. Park, S.L. Min and Y. Cho,
    The working set algorithm has competitive ratio less than two,
    Information Processing Letters 63 (1997), 183-188. SCI
  • M. Crochemore, Z. Galil, L. Gasieniec, K. Park and W. Rytter,
    Constant-time randomized parallel string matching,
    SIAM Journal on Computing 26, 4 (1997), 950-960. SCI
  • C.S. Iliopoulos, D.W.G. Moore and K. Park,
    Covering a string,
    Algorithmica 16 (1996), 288-297. SCI
  • Z. Galil and K. Park,
    Alphabet-independent two-dimensional witness computation,
    SIAM Journal on Computing 25, 5 (1996), 907-935. SCI
  • C.S. Iliopoulos and K. Park
    A work-time optimal algorithm for computing all string covers,
    Theoretical Computer Science 164 (1996), 299-310. SCI
  • O. Berkman, C.S. Iliopoulos and K. Park,
    The subtree max gap problem with application to parallel string covering,
    Information and Computation 123, 1 (1995), 127-137. SCI
  • S.S. Lim, Y.H. Bae, G.T. Jang, B.D. Rhee, S.L. Min, C.Y. Park, H. Shin, K. Park, S.M. Moon and C.S. Kim,
    An accurate worst case timing analysis for RISC processors,
    IEEE Transactions on Software Engineering 21, 7 (1995), 593-604. SCI
  • A. Amir, M. Farach, Z. Galil, R. Giancarlo and K. Park,
    Dynamic dictionary matching,
    Journal of Computer and System Sciences 49 (1994), 208-222. SCI
  • Z. Galil and K. Park,
    Parallel algorithms for dynamic programming recurrences with more than O(1) dependency,
    Journal of Parallel and Distributed Computing 21 (1994), 213-222. SCI
  • B.F. Wang, G.H. Chen and K. Park,
    On the Set LCS and Set-Set LCS problems,
    Journal of Algorithms 14 (1993), 466-477. SCI
  • Z. Galil and K. Park,
    Dynamic programming with convexity, concavity and sparsity,
    Theoretical Computer Science 92, 1 (1992), 49-76. SCI
  • Z. Galil and K. Park,
    linear-time algorithm for concave one-dimensional dynamic programming,
    Information Processing Letters 33 (1990), 309-311. SCI
  • Z. Galil and K. Park,
    An improved algorithm for approximate string matching,
    SIAM Journal on Computing 19, 6 (1990), 989-999. SCI