Skip to main content
Springer Nature Link
Log in

Succinct Data Structures for Parentheses Matching

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 182 Accesses

Years and Authors of Summarized Original Work

  • 2001; Munro, Raman

Problem Definition

This problem is to design succinct representation of balanced parentheses in a manner in which a number of “natural” queries can be supported quickly, and use it to represent trees and graphs succinctly. The problem of succinctly representing balanced parentheses was initially proposed by Jacobson [6] in 1989, when he proposed succinct data structures, i.e., data structures that occupy space close to the information-theoretic lower bound to represent them, while supporting efficient navigational operations. Succinct data structures provide solutions to manipulate large data in modern applications. The work of Munro and Raman [8] provides an optimal solution to the problem of balanced parentheses representation under the word RAM model, based on which they design succinct trees and graphs.

Balanced Parentheses

Given a balanced parenthesis sequence of length 2n, where there are n opening parentheses and n...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bernhart F, Kainen PC (1979) The book thickness of a graph. J Comb Theory B 27(3):320–331

    Article  MathSciNet  MATH  Google Scholar 

  2. Chiang Y-T, Lin C-C, Lu H-I (2005) Orderly spanning trees with applications. SIAM J Comput 34(4):924–945

    Article  MathSciNet  MATH  Google Scholar 

  3. Chuang RC-N, Garg A, He X, Kao M-Y, Lu H-I (2001) Compact encodings of planar graphs via canonical orderings and multiple parentheses. Comput Res Repos. cs.DS/0102005

    Google Scholar 

  4. Geary RF, Rahman N, Raman R, Raman V (2006) A simple optimal representation for balanced parentheses. Theor Comput Sci 368(3):231–246

    Article  MathSciNet  MATH  Google Scholar 

  5. Grossi R, Gupta A, Vitter JS (2003) High-order entropy-compressed text indexes. In: Farach-Colton M (ed) Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms. SIAM, Philadelphia, pp 841–850

    Google Scholar 

  6. Jacobson G (1989) Space-efficient static trees and graphs. In: Proceedings of the 30th annual IEEE symposium on foundations of computer science. IEEE, New York, pp 549–554

    Google Scholar 

  7. Lu H-I, Yeh C-C (2007) Balanced parentheses strike back. Accepted to ACM Trans Algorithms

    Google Scholar 

  8. Munro JI, Raman V (2001) Succinct representation of balanced parentheses and static trees. SIAM J Comput 31(3):762–776

    Article  MathSciNet  MATH  Google Scholar 

  9. Munro JI, Raman V, Rao SS (2001) Space efficient suffix trees. J Algorithms 39(2):205–222

    Article  MathSciNet  MATH  Google Scholar 

  10. Munro JI, Raman V, Storm AJ (2001) Representing dynamic binary trees succinctly. In: Rao Kosaraju S (ed) Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. SIAM, Philadelphia, pp 529–536

    Google Scholar 

  11. Munro JI, Rao SS (2004) Succinct representations of functions. In: Díaz J, Karhumäki J, Lepistö A, Sannella D (eds) Proceedings of the 31st international colloquium on automata, languages and programming. Springer, Heidelberg, pp 1006–1015

    Chapter  Google Scholar 

  12. Raman R, Rao SS (2003) Succinct dynamic dictionaries and trees. In: Baeten JCM, Lenstra JK, Parrow J, Woeginger GJ (eds) Proceedings of the 30th international colloquium on automata, languages and programming. Springer, Heidelberg, pp 357– 368

    Chapter  Google Scholar 

  13. Sadakane K (2007) Compressed suffix trees with full functionality. Theory Comput Syst. Online first. http://dx.doi.org/10.1007/s00224-006-1198-x

  14. Weiner P (1973) Linear pattern matching algorithms. In: Proceedings of the 14th annual IEEE symposium on switching and automata theory. IEEE, New York, pp 1–11

    Google Scholar 

  15. Yannakakis M (1986) Four pages are necessary and sufficient for planar graphs. In: Hartmanis J (ed) Proceedings of the 18th annual ACM-SIAM symposium on theory of computing. ACM, New York, pp 104–108

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, ON, Canada

    Meng He

Authors
  1. Meng He
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

He, M. (2016). Succinct Data Structures for Parentheses Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_410

Download citation

Publish with us

Policies and ethics