# Search results for: Inbok Lee

KSCE Journal of Civil Engineering > 2018 > 22 > 2 > 747-754

International Journal of Hydrogen Energy > 2016 > 41 > 41 > 18663- 18686

*δγ*–matching and parameterized matching. The solution is essentially obtained by a combination of bitparallel techniques and a reduction to a graph matching problem. The time complexity of the algorithm is

*O*(

*nm*), assuming text size

*n*, pattern size

*m*and a constant size alphabet.

Lecture Notes in Computer Science > Computational Science – ICCS 2006 > Intelligent and Collaborative System Integration Technology (ICSIT) > 289-292

*k*-keyword proximity score [3] in more realistic environments. Furthermore, we show that they can be used to find longest repetitive...

Lecture Notes in Computer Science > String Processing and Information Retrieval > String Processing and Information Retrieval 2005 > 191-201

Lecture Notes in Computer Science > Fuzzy Systems and Knowledge Discovery > Knowledge Visualization and Exploration > 1137-1140

Lecture Notes in Computer Science > MICAI 2006: Advances in Artificial Intelligence > Classification > 583-592

Lecture Notes in Computer Science > Computational Science and Its Applications - ICCSA 2006 > General Tracks > 1137-1142

*δ*,

*γ*)-matching. Given a text

*T*of length

*n*, a pattern

*P*of length

*m*,and two parameters

*δ*and

*γ*, the aim is to find all the substring

*T*[

*i*,

*i*+

*m*–1] such that (a) ∀ 1 ≤

*j*≤

*m*, |

*T*[

*i*+

*j*–1] –

*P*[

*j*]| ≤

*δ*(

*δ*-matching) , and (b) ∑

_{1 ≤ j ≤ m}|

*T*[

*i*+

*j*...

*U*={

*T*

_{1},

*T*

_{2}, ... ,

*T*

_{ℓ}}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of

*U*. We also consider reversed and reverse-complemented repeats as well as normal repeats. We present a linear time algorithm for the longest common repeat problem.

Lecture Notes in Computer Science > Adaptive and Natural Computing Algorithms > Learning, Optimization and Games > 554-561

*a*,

*b*). We propose a simple and compact algorithm for this problem when the queries are sorted in ascending order. Then we show how to use this algorithm for the generalised longest common repeat problem [14]. Our algorithm is easy to understand and implement and requires much smaller memory.

Lecture Notes in Computer Science > Rough Sets, Fuzzy Sets, Data Mining and Granular Computing > Text and Web Mining > 248-255

Theoretical Computer Science > 2014 > 525 > Complete > 80-88

Process Safety Progress > 32 > 4 > 393 - 400

2011 12th International Radar Symposium (IRS) > 465 - 470

Journal of Discrete Algorithms > 2007 > 5 > 2 > 243-249

Information Processing Letters > 2004 > 91 > 3 > 115-120