KJCKorea
Journal Central

@article{ART001444160},
author={Jinwoon Woo},
title={Constant Time RMESH Algorithm for Finding Maximal Palindromes of String},
journal={Journal of Knowledge Information Technology and Systems},
issn={1975-7700},
year={2010},
volume={5},
number={2},
pages={59-67}

TY - JOUR
AU - Jinwoon Woo
TI - Constant Time RMESH Algorithm for Finding Maximal Palindromes of String
JO - Journal of Knowledge Information Technology and Systems
PY - 2010
VL - 5
IS - 2
PB - Korea Knowledge Information Technology Society
SP - 59
EP - 67
SN - 1975-7700
AB - Since string operations were applied to computational biology area, various data structures and algorithms for computing efficient string operations have been studied. The maximal palindrome problem is an operation to find the maximal symmetric substrings in a string. This operation is importantly used in the string processing area such as pattern matching and likelihood measurement. In this paper, we present an algorithm to compute the maximal palindromes of the given string using three-dimensional n×n×n processors on RMESH(Reconfigurable MESH). The algorithm has O(1) constant time complexity, which is usefully used in the massive data processing areas like the computational biology.
KW - string;maximal palindrome;edit distance;constant time;RMESH
DO -
UR -
ER -

Jinwoon Woo. (2010). Constant Time RMESH Algorithm for Finding Maximal Palindromes of String. Journal of Knowledge Information Technology and Systems, 5(2), 59-67.

Jinwoon Woo. 2010, "Constant Time RMESH Algorithm for Finding Maximal Palindromes of String", Journal of Knowledge Information Technology and Systems, vol.5, no.2 pp.59-67.

Jinwoon Woo "Constant Time RMESH Algorithm for Finding Maximal Palindromes of String" Journal of Knowledge Information Technology and Systems 5.2 pp.59-67 (2010) : 59.

Jinwoon Woo. Constant Time RMESH Algorithm for Finding Maximal Palindromes of String. 2010; 5(2), 59-67.

Jinwoon Woo. "Constant Time RMESH Algorithm for Finding Maximal Palindromes of String" Journal of Knowledge Information Technology and Systems 5, no.2 (2010) : 59-67.

Jinwoon Woo. Constant Time RMESH Algorithm for Finding Maximal Palindromes of String. Journal of Knowledge Information Technology and Systems, 5(2), 59-67.

Jinwoon Woo. Constant Time RMESH Algorithm for Finding Maximal Palindromes of String. Journal of Knowledge Information Technology and Systems. 2010; 5(2) 59-67.

Jinwoon Woo. Constant Time RMESH Algorithm for Finding Maximal Palindromes of String. 2010; 5(2), 59-67.

Jinwoon Woo. "Constant Time RMESH Algorithm for Finding Maximal Palindromes of String" Journal of Knowledge Information Technology and Systems 5, no.2 (2010) : 59-67.