Hwee Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hwee Kim has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Da-Jung Cho
Yonsei University
3 shared publications - Yo-Sub Han
Yonsei University
3 shared publications - Kai Salomaa
School of Computing, Queen’s University, Kingston, Canada
2 shared publications - Alexandros Palioudakis
Yonsei University
1 shared publication Da-Jung Cho
Yonsei University
1 shared publication- Sang-Ki Ko
Yonsei University
1 shared publication
Latest Publications
- 28 April 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 194-205
Deduplication on Finite Automata and Nested Duplication Systems
- 28 April 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 194-205
Deduplication on Finite Automata and Nested Duplication Systems
- 16 December 2015
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 32 (8) , 1151-1157
OMPPM: online multiple palindrome pattern matching
Motivation: A palindrome is a string that reads the same forward and backward. Finding palindromic substructures is important in DNA, RNA or protein sequence analysis. We say that two strings of the same length are pal-equivalent if, for each possible center, they have the same length of the maximal palindrome. Given a text T of length n and a pattern P of length m, we study the palindrome pattern matching problem that finds all indices i such that P and T[i–m+1 : i] are pal-equivalent.
- 16 December 2015
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 32 (8) , 1151-1157
OMPPM: online multiple palindrome pattern matching
Motivation: A palindrome is a string that reads the same forward and backward. Finding palindromic substructures is important in DNA, RNA or protein sequence analysis. We say that two strings of the same length are pal-equivalent if, for each possible center, they have the same length of the maximal palindrome. Given a text T of length n and a pattern P of length m, we study the palindrome pattern matching problem that finds all indices i such that P and T[i–m+1 : i] are pal-equivalent.
- 19 May 2015
- Published by Springer Nature in Natural Computing
- Vol. 15 (1) , 31-39
Pseudo-inversion: closure properties and decidability
- 19 May 2015
- Published by Springer Nature in Natural Computing
- Vol. 15 (1) , 31-39
Pseudo-inversion: closure properties and decidability
- 24 February 2015
- Published by Springer Nature
- p. 121-132
Frequent Pattern Mining with Non-overlapping Inversions
- 24 February 2015
- Published by Springer Nature
- p. 121-132
Frequent Pattern Mining with Non-overlapping Inversions