a simple optimal representation for balanced parentheses：一个简单的平衡圆括号表示.pdfVIP

Theoretical Computer Science 368 (2006) 231–246 /locate/tcs A simple optimal representation for balanced parentheses a a a ,∗ b Richard F. Geary , Naila Rahman , Rajeev Raman , Venkatesh Raman aDepartment of Computer Science, University of Leicester, Leicester LE1 7RH, UK bInstitute of Mathematical Sciences, Chennai 600 113, India Abstract We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, which support natural operations such as finding the matching parenthesis for a given parenthesis, or finding the pair of parentheses that most tightly enclose a given pair. This problem was considered by Jacobson [Space-efficient static trees and graphs, in: Proc. of the 30th FOCS, 1989, pp. 549–554] and Munro and Raman [Succinct representation of balanced parentheses and static trees, SIAM J. Comput. 31 (2001) 762–776] who gave O(n)-bit and 2n + o(n)-bit representations, respectively, that supported the above operations in O(1) time on the RAM model of computation. This data structure is a fundamental tool in succinct representations, and has applications in representing suffix trees, ordinal trees, planar graphs and permutations. We consider the practical performance of parenthesis representations. First, we give a new 2n + o(n)-bit representation that supports all the above operations in O(1) time. This representation is conceptually simpler, its space bound has a smaller o(n) term and it also has a simple and uniform o(n) time and space construction algorithm.