• DocumentCode
    2116045
  • Title

    Efficient tree pattern matching

  • Author

    Kosaraju, S. Rao

  • Author_Institution
    Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
  • fYear
    1989
  • fDate
    30 Oct-1 Nov 1989
  • Firstpage
    178
  • Lastpage
    183
  • Abstract
    A classic open problem on tree pattern matching is whether the naive O(mn)-step algorithm for finding all the occurrences of a pattern tree of size m in a text tree of size n can be improved. An O(nM0.75 polylog(m))-step algorithm for this tree pattern matching problem is designed. The problems of linear string matching with don´t care symbols and linear string max-min convolution are treated
  • Keywords
    combinatorial mathematics; data structures; trees (mathematics); O(mn)-step algorithm; linear string matching; linear string max-min convolution; text tree; tree pattern matching; Algorithm design and analysis; Computer science; Convolution; Costs; Labeling; Partitioning algorithms; Pattern matching; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1989., 30th Annual Symposium on
  • Conference_Location
    Research Triangle Park, NC
  • Print_ISBN
    0-8186-1982-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1989.63475
  • Filename
    63475
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2116045