Finding All-Pairs Suffix-Prefix Matching Using Suffix Array 


Vol. 17,  No. 5, pp. 221-228, Oct.  2010
10.3745/KIPSTA.2010.17.5.221


PDF
  Abstract

Since string operations were applied to computational biology, security and search for Internet, 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 propose an algorithm to find all-pairs suffix-prefix matching using the suffix array, which takes time complexity. The suffix array algorithm is proven to be better than the suffix tree algorithm by showing it takes less time and memory through experiments.

  Statistics
  Cite this article

[IEEE Style]

S. M. Han and J. W. Woo, "Finding All-Pairs Suffix-Prefix Matching Using Suffix Array," The KIPS Transactions:PartA, vol. 17, no. 5, pp. 221-228, 2010. DOI: 10.3745/KIPSTA.2010.17.5.221.

[ACM Style]

Seon Mi Han and Jn Woon Woo. 2010. Finding All-Pairs Suffix-Prefix Matching Using Suffix Array. The KIPS Transactions:PartA, 17, 5, (2010), 221-228. DOI: 10.3745/KIPSTA.2010.17.5.221.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals