최장공통비상위문자열을 찾는 새로운 알고리즘

초록

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. In this paper, we first propose a new graph model using prefixes of . Next, we suggest an -time algorithm for finding the LCNSS of , where is the sum of the lengths of all the strings in .

키워드