Linear-time longest-common-prefix computation in suffix arrays and its applications GM Landau, T Kasai, G Lee, H Arimura, S Arikawa, K Park Combinatorial Pattern Matching: 12th Annual Symposium, CPM 2001 Jerusalem …, 2001 | 691 | 2001 |
An accurate worst case timing analysis for RISC processors SS Lim, YH Bae, GT Jang, BD Rhee, SL Min, CY Park, H Shin, K Park, ... IEEE transactions on software engineering 21 (7), 593-604, 1995 | 551 | 1995 |
Linear-time construction of suffix arrays DK Kim, JS Sim, H Park, K Park Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003 Morelia …, 2003 | 340 | 2003 |
An improved algorithm for approximate string matching Z Galil, K Park SIAM Journal on Computing 19 (6), 989-999, 1990 | 241 | 1990 |
Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together M Han, H Kim, G Gu, K Park, WS Han Proceedings of the 2019 International Conference on Management of Data, 1429 …, 2019 | 207 | 2019 |
Order-preserving matching J Kim, P Eades, R Fleischer, SH Hong, CS Iliopoulos, K Park, SJ Puglisi, ... Theoretical Computer Science 525, 68-79, 2014 | 168 | 2014 |
Dynamic dictionary matching A Amir, M Farach, Z Galil, R Giancarlo, K Park Journal of Computer and System Sciences 49 (2), 208-222, 1994 | 138 | 1994 |
Constructing suffix arrays in linear time DK Kim, JS Sim, H Park, K Park Journal of Discrete Algorithms 3 (2-4), 126-142, 2005 | 120 | 2005 |
Covering a string CS Iliopoulos, DWG Moore, K Park Algorithmica 16 (3), 288-297, 1996 | 119 | 1996 |
Moments of the spin structure functions g1p and g1d for 0.05< Q2< 3.0 GeV2 Y Prok, P Bosted, VD Burkert, A Deur, KV Dharmawardane, GE Dodge, ... Physics Letters B 672 (1), 12-16, 2009 | 104 | 2009 |
Truly alphabet-independent two-dimensional pattern matching Z Galil, K Park Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 247-256, 1992 | 101 | 1992 |
A fast algorithm for order-preserving pattern matching S Cho, JC Na, K Park, JS Sim Information Processing Letters 115 (2), 397-402, 2015 | 98 | 2015 |
Dynamic programming with convexity, concavity and sparsity Z Galil, K Park Theoretical Computer Science 92 (1), 49-76, 1992 | 96 | 1992 |
Parallel algorithms for dynamic programming recurrences with more than O (1) dependency Z Galil, K Park Journal of Parallel and Distributed Computing 21 (2), 213-222, 1994 | 92 | 1994 |
A linear-time algorithm for concave one-dimensional dynamic programming Z Galil, K Park | 84 | 1989 |
Truncated suffix trees and their application to data compression JC Na, A Apostolico, CS Iliopoulos, K Park Theoretical Computer Science 304 (1-3), 87-101, 2003 | 82 | 2003 |
The consensus string problem for a metric is NP-complete JS Sim, K Park Journal of Discrete Algorithms 1 (1), 111-117, 2003 | 79 | 2003 |
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions R Cole, M Crochemore, Z Galil, L Gasieniec, R Eariharan, ... Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 248-258, 1993 | 64 | 1993 |
The influence of the signal dynamics of activated form of IKK on NF-κB and anti-apoptotic gene expressions: A systems biology approach SG Park, T Lee, HY Kang, K Park, KH Cho, G Jung FEBS letters 580 (3), 822-830, 2006 | 62 | 2006 |
Versatile equivalences: Speeding up subgraph query processing and subgraph matching H Kim, Y Choi, K Park, X Lin, SH Hong, WS Han Proceedings of the 2021 International Conference on Management of Data, 925-937, 2021 | 59 | 2021 |