| Finding patterns with variable length gaps or don’t cares MS Rahman, CS Iliopoulos, I Lee, M Mohamed, WF Smyth Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006 | 56 | 2006 |
| Reliable flying IoT networks for UAV disaster rescue operations T Ahn, J Seok, I Lee, J Han Mobile Information Systems 2018, 2018 | 41 | 2018 |
| δγ – Parameterized Matching I Lee, J Mendivelso, YJ Pinzón String Processing and Information Retrieval: 15th International Symposium …, 2009 | 23 | 2009 |
| Approximate Function Matching under δ- and γ- Distances J Mendivelso, I Lee, YJ Pinzón String Processing and Information Retrieval: 19th International Symposium …, 2012 | 17 | 2012 |
| A fast algorithm for the generalized k-keyword proximity problem given keyword offsets SR Kim, I Lee, K Park Information processing letters 91 (3), 115-120, 2004 | 16 | 2004 |
| Finding approximate occurrences of a pattern that contains gaps I Lee, A Apostolico, CS Iliopoulos, K Park Proceedings of the 14th Australasian Workshop on Combinatorial Algorithms …, 2003 | 15 | 2003 |
| Optimizing weighted kernel function for support vector machine by genetic algorithm HN Nguyen, SY Ohn, SH Chae, DH Song, I Lee MICAI 2006: Advances in Artificial Intelligence: 5th Mexican International …, 2006 | 14 | 2006 |
| Algorithms on Extended (δ, γ)-Matching I Lee, R Clifford, SR Kim International Conference on Computational Science and its Applications, 1137 …, 2006 | 13 | 2006 |
| On finding a longest common palindromic subsequence SW Bae, I Lee Theoretical Computer Science 710, 29-34, 2018 | 12 | 2018 |
| Linear time algorithm for the longest common repeat problem I Lee, CS Iliopoulos, K Park Journal of Discrete Algorithms 5 (2), 243-249, 2007 | 11 | 2007 |
| A simple and scalable algorithm for the IP address lookup problem I Lee, K Park, Y Choi, SK Chung Fundamenta Informaticae 56 (1-2), 181-190, 2003 | 8 | 2003 |
| Finding overlaps within regular expressions with variable-length gaps J Mendivelso, Y Pinzón, I Lee Proceedings of the 2013 Research in Adaptive and Convergent Systems, 16-21, 2013 | 6 | 2013 |
| Fast filtering for intrusion detection systems with the shift-or algorithm SI Oh, I Lee, MS Kim 2012 18th Asia-Pacific Conference on Communications (APCC), 869-870, 2012 | 6 | 2012 |
| Linear time algorithm for the longest common repeat problem I Lee, CS Iliopoulos, K Park String Processing and Information Retrieval: 11th International Conference …, 2004 | 6 | 2004 |
| A simple heuristic for order-preserving matching JC Na, I Lee IEICE TRANSACTIONS on Information and Systems 102 (3), 502-504, 2019 | 5 | 2019 |
| REduce: Removing redundancy from regular expression matching in network security VC Valgenti, MS Kim, SI Oh, I Lee 2015 24th International Conference on Computer Communication and Networks …, 2015 | 5 | 2015 |
| Linear time algorithm for the generalised longest common repeat problem I Lee, YJP Ardila International Symposium on String Processing and Information Retrieval, 191-201, 2005 | 5 | 2005 |
| Order preserving matching with k mismatches I Lee Smart Media Journal 9 (2), 33-38, 2020 | 2 | 2020 |
| Fast single individual haplotyping method using GPGPU JC Na, I Lee, JK Rhee, SY Shin Computers in Biology and Medicine 113, 103421, 2019 | 2 | 2019 |
| 시그니처 기반 침입 탐지 시스템의 최적화 이인복， 오성일 정보과학회지 33 (6), 55-60, 2015 | 2 | 2015 |
Kunsoo ParkProfessor of Computer Science, Seoul National UniversityVerified email at theory.snu.ac.kr
