Browse > Article

A New Algorithm for the Longest Common Non-superstring  

Choi, Si-Won (인하대학교 컴퓨터정보공학부)
Lee, Dok-Young (서울대학교 컴퓨터공학부)
Kim, Dong-Kyue (한양대학교 전자통신컴퓨터공학부)
Na, Joong-Chae (세종대학교 컴퓨터공학과)
Sim, Jeong-Seop (인하대학교 컴퓨터정보공학부)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.15, no.1, 2009 , pp. 67-71 More about this Journal
Abstract
Recently, the string non-inclusion related problems have been studied vigorously. Given a set of strings F over a constant size alphabet, consider a string x such that x does not include any string in F as a substring. We call x a Common Non-SuperString(CNSS for short) of F. Among the CNSS's of F, the longest one with finite length is called the Longest Common Non-SuperString(LCNSS for short) of F. In this paper, we first propose a new graph model using prefixes of F. Next, we suggest an O(N)-time algorithm for finding the LCNSS of F, where N is the sum of the lengths of all the strings in F.
Keywords
string non-inclusion; longest common non-superstring;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. A. Pevzner, and R. J. Lipshutz, Towards DNA Sequencing Chips, Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994, August 22-26, 143-158, 1994
2 M. Li. Towards a DNA sequencing theory. 31st IEEE Symposium on Foundations of Computer Science, 125-134, 1990   DOI
3 V. G. Timkovsky, Complexity of common subse-quence and supersequence problems and related problems, Cybernetics and Systems Analysis 25, 5, 565-580, 1990   DOI
4 T. Jiang, and V. G. Timkovsky, Shortest consistent superstrings computable in polynomial time, Theo-retical Computer Science 143, 1, 113-122, 1995   DOI
5 T. Jiang, and M. Li, DNA Sequencing and String Learning, Mathematical Systems Theory 29, 4, 387-405, 1996   DOI
6 A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear approximation of shortest superstrings, In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 328-336, 1991   DOI
7 M. R. Garey, and D. S. Johnson, Computers and Intractability, Freeman, 1979
8 D. S. Hirschberg, Algorithms for the Longest Common Subsequence Problem, Journal of the ACM, 24, 4, 664-675, 1977   DOI
9 J. Gallant, D. Maier, and J. Storer, On finding minimal length superstrings, Journal of computer and System Sciences, 20, 50-58, 1980   DOI   ScienceOn
10 A. H. Rubinov, and V. G. Timkovsky, String noninclusion optimization problems, SIAM Journal on Discrete Mathematics 11, 3, 456-467, 1998   DOI   ScienceOn