Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2010.17A.5.221

Finding All-Pairs Suffix-Prefix Matching Using Suffix Array  

Han, Seon-Mi (단국대학교 컴퓨터과학)
Woo, Jin-Woon (단국대학교 정보컴퓨터학부)
Publication Information
The KIPS Transactions:PartA / v.17A, no.5, 2010 , pp. 221-228 More about this Journal
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 O($k{\cdot}m$)�� 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.
Keywords
Suffix-Prefix Matching; String Matching; Suffix Array; Suffix Tree;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 K. Sadakane, “Succinct representation of lcp information and improvement in the compressed suffix arrays,” In. proc. of the 13th ACM-SIAM Symposium on Discrete algorithms, pp.225-232, 2002.
2 M. Abouelhoda, S. Kurtz, E. Ohlebusch, “Replacing Suffix Trees with Enhanced Suffix Arrays,” Journal of Discrete Algorithms, Vol.2, pp.53-86, 2004.   DOI   ScienceOn
3 P. Ferragina, G. Manzini, “Opportunistic data structures with applications,” In Proc. of the 41st IEEE Symposium on Foundations of Computer Science, pp.390-398, 2000.   DOI
4 심정섭, 김동규, 박희진, 박근수, “접미사 배열을 이용한 선형시간 탐색”, 정보과학회 논문지: 시스템 및 이론, 제 32권 제 5호, pp.255-259, 2005.
5 최용욱, 심정섭, 박근수, “접미사 배열을 이용한 시간과 공간 효율적인 검색”, 정보과학회 논문지: 시스템 및 이론, 제 32권 제 5호, pp.260-267, 2005.
6 P. Green, D. Lipman, D. Hillier, R. Waterston, D. States, J. M. Claverie. “Ancient conserved regions in new gene sequences and the protein databases,” Science, Vol.259, pp.1711-1716, 1993.   DOI
7 E. M. McCrieght, “A Space-Economical Suffix Tree Construction Algorithm,” Journal of ther ACM, Vol.23, pp.262-272, 1976.   DOI   ScienceOn
8 P. Ko and S. Aluru, “Space efficient linear time construction of suffix arrays,” In Proc. of the 14th Annual Symposium on Combinatorial Pattern Matching, Vol.2676, pp.200-210, 2003.   DOI   ScienceOn
9 E. Ukkonen, “On-line construction of suffix trees,” Algorithmica, Vol.14, pp.249-260, 1995.   DOI
10 U. Manber, G. Myers, “Suffix arrays: a new method for on-line string searches,” SIAM Journal of Computing 22, pp.935-948, 1993.   DOI   ScienceOn
11 J. Karkkainen, P. Sanders, S. Burkhardt, “Linear work suffix array construction,” Journal of the ACM, Vol.53, pp.918-936, 2006.   DOI   ScienceOn
12 D. K. Kim, J. S. Sim, H. Park, K. Park, “Constructing suffix arrays in linear time,” Journal of Discrete Algorithms, Vol.3, pp.126-142, 2005.   DOI   ScienceOn
13 R. Grossi, J. S. Vitter, “Compressed suffix arrays and suffix trees with applications to text indexing and string matching,” In Proc. of the 32nd ACM Symposium on Theory of Computing, pp.397-406, 2000.   DOI
14 WK. Hon, K. Sadakane, WK. Sung, “Breaking a timeand-space barrier in constructing full-text indices,” In Proc. of the 44th Symposium on Foundations of Computer Science, pp.251-260, 2003.   DOI
15 M. Abouelhoda, E. Ohlebusch, S. Kurtz, “Optimal exact string matching based on suffix arrays,” In Proc. of the 9th International Symposium on String Processing and Information Retrieval. Vol.2476, pp.31-43, 2002.   DOI
16 Z. M. Kedem. G. M. Landau, K. V. Palem, “Parallel suffix-prefix-Matching Algorithm and Applications,” SIAM Journal on Computing, Vol.25, No.5, pp.998-1023, 1996.   DOI   ScienceOn
17 D. Gusfield, “Algorithms on Strings, Trees, and Sequences,” Computer Science and Computational Biology, CamBridge University Press, 1997.