Skip to main content
SpringerLink
Log in

Efficient preprocessing of simple binary pattern forests

  • Conference paper
  • First Online:
Algorithm Theory — SWAT '94 (SWAT 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 824))

Included in the following conference series:

  • 143 Accesses

Abstract

Multi-pattern matching in trees is fundamental to a variety of programming language systems. A bottleneck in this connection has been the combinatorial problem of constructing the immediate subsumption tree for a simple binary pattern forest. We reduce the complexity of this problem from O(n 2) time and O(n 2) space to O(n log n) time and O(n) space. Such a result was conjectured possible in 1982 by Hoffmann and O'Donnell, and in 1992 finding it was called a main open problem by Cai, Paige, and Tarjan.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cai, J., Paige, R., and Tarjan, R., More efficient bottom-up multi-pattern matching in trees. Theor. Comp. Sci.106 (1992) 21–60.

    Google Scholar 

  2. Dietz, P.F. Maintaining order in a linked list. In: Proc. 14th STOC (ACM, 1982) 122–127.

    Google Scholar 

  3. Dietz, P.F. and Sleator, D.D. Two algorithms for maintaining order in a list. In: Proc. 19th STOC (ACM, 1987) 365–372.

    Google Scholar 

  4. Hoffmann, C. and O'Donnell, J. An interpreter generator using tree pattern matching. In: Proc. 6th. POPL (ACM, 1979) 169–179.

    Google Scholar 

  5. Hoffman, C. and O'Donnell, J., Pattern matching in trees. J. ACM29:1 (1982) 68–95.

    Article  Google Scholar 

  6. Knuth, D., Morris, J. and Pratt, V., Fast pattern matching in strings. SIAM J. Comput.6:2 (1977) 323–350.

    Article  Google Scholar 

  7. Wegbreit, B., Retrieval from context trees. Inf. Proc. Lett.3:4 (1975) 119–120.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Kbh. Ø, Denmark

    Mikkel Thorup

Authors
  1. Mikkel Thorup
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Erik M. Schmidt Sven Skyum

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thorup, M. (1994). Efficient preprocessing of simple binary pattern forests. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-58218-5_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58218-2

  • Online ISBN: 978-3-540-48577-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation