본문 바로가기
  • Home

Constant Time RMESH Algorithm for Finding All-pairs Suffix-prefix Matching of Strings

  • Journal of Knowledge Information Technology and Systems
  • Abbr : JKITS
  • 2011, 6(3), pp.161-170
  • Publisher : Korea Knowledge Information Technology Society
  • Research Area : Interdisciplinary Studies > Interdisciplinary Research
  • Published : June 30, 2011

Jinwoon Woo 1

1단국대학교

Candidate

ABSTRACT

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.

Citation status

* References for papers published after 2023 are currently being built.