스트링의 최대 서픽스를 계산하는 효율적인 외부 메모리 알고리즘

Abstract

ABSTRACT We study the problem of finding the maximum suffix of a string on the external memory model of computation with one disk. In this model, we are primarily interested in designing algorithms that reduce the number of I/Os between the disk and the internal memory. A string of length  has  suffixes and among these, the lexicographically largest one is called the maximum suffix of the string. Finding the maximum suffix of a string plays a crucial role in solving some string problems. In this paper, we present an external memory algorithm for computing the maximum suffix of a string of length . The algorithm uses four blocks in the internal memory and performs at most 4 disk I/Os, where  is the size of a block.Keyword:External Memory Algorithms, Maximum Suffix, Strings 1. Introduction 1) Let ∑ be an alphabet. Let  and  be two strings over ∑. If s is lexicographically less than  , we denote this by  . Let     , where N is the length of  . For ≤≤≤ ,   