@article{ART001569396},
author={Jinwoon Woo},
title={Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings},
journal={Journal of Knowledge Information Technology and Systems},
issn={1975-7700},
year={2011},
volume={6},
number={3},
pages={161-170}
TY - JOUR
AU - Jinwoon Woo
TI - Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings
JO - Journal of Knowledge Information Technology and Systems
PY - 2011
VL - 6
IS - 3
PB - Korea Knowledge Information Technology Society
SP - 161
EP - 170
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 all-pairs suffix-prefix matching is to find the longest suffix and prefix among given strings. The matching algorithm is importantly used for fast approximation algorithm to find the shortest superstring, as well as for bio-informatics and data compressions. In this paper, we present an algorithm to find all-pairs suffix-prefix matchings of the given strings using three-dimensional processors on RMESH(Reconfigurable MESH). The algorithm has time complexity.
KW - string;suffix-prefix matching;string matching;RMESH;time complexity
DO -
UR -
ER -
Jinwoon Woo. (2011). Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings. Journal of Knowledge Information Technology and Systems, 6(3), 161-170.
Jinwoon Woo. 2011, "Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings", Journal of Knowledge Information Technology and Systems, vol.6, no.3 pp.161-170.
Jinwoon Woo "Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings" Journal of Knowledge Information Technology and Systems 6.3 pp.161-170 (2011) : 161.
Jinwoon Woo. Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings. 2011; 6(3), 161-170.
Jinwoon Woo. "Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings" Journal of Knowledge Information Technology and Systems 6, no.3 (2011) : 161-170.
Jinwoon Woo. Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings. Journal of Knowledge Information Technology and Systems, 6(3), 161-170.
Jinwoon Woo. Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings. Journal of Knowledge Information Technology and Systems. 2011; 6(3) 161-170.
Jinwoon Woo. Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings. 2011; 6(3), 161-170.
Jinwoon Woo. "Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings" Journal of Knowledge Information Technology and Systems 6, no.3 (2011) : 161-170.