In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, and especially in the last few years, suffix array construction algorithms have proliferated in bewildering abundance. This survey paper attempts to provide simple high-level descriptions of these numerous algorithms that highlight both their distinctive features and their commonalities, while avoiding as much as possible the complexities of implementation details. New hybrid algorithms are also described. We provide comparisons of the algorithms' worst-case time complexity and use of additional space, together with results of recent experimental test runs on many of their implementations.

Let G = ( V A) denote a simple connected directed graph, and let n = jV j, m = jAj, where n ; 1 m ; n 2 . A feedback arc set (FAS) o f G, denoted R(G), is a (possibly empty) set of arcs whose reversal makes G acyclic. A minimum feedback arc s e t of G, denoted R (G), is a FAS of minimum cardinality r (G) the computation of R (G) is called the FAS problem. F or every n, let (n) denote the maximum,

No abstract

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.

No abstract