Patterns and Pattern-Matching in Trees: An Analysis

This paper presents general results on the probabilities of occurrences of patterns in trees, which serve to analyze a commonly used pattern matching algorithm on trees. It appears that for a wide class of statistics on trees, pattern-matching has a linear expected time complexity (in contrast to a quadratic worst-case behaviour). The methods used are both combinatorial and analytic and prove useful in the evaluation of a wide class of tree algorithms.

[1]  Philippe Flajolet,et al.  A complexity calculus for classes of recursive search programs over tree structures , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Philippe Flajolet,et al.  The Average Height of Binary Trees and Other Simple Trees , 1982, J. Comput. Syst. Sci..

[3]  Philippe Flajolet,et al.  On the analysis of tree-matching algorithms , 1980, CLAAP.

[4]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[5]  Philippe Flajolet,et al.  Analyse d'algorithmes de manipulation d'arbres et de fichiers , 1981 .

[6]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[7]  G. Darboux,et al.  Mémoire sur l'approximation des fonctions de très-grands nombres, et sur une classe étendue de développements en série. , 1878 .

[8]  Philippe Flajolet,et al.  The Number of Registers Required for Evaluating Arithmetic Expressions , 1979, Theor. Comput. Sci..

[9]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[10]  I. J. Good.  The generalization of Lagrange's expansion and the enumeration of trees , 1965 .

[11]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[12]  J. Lagrange.  Théorie des fonctions analytiques , 1967 .

[13]  Arnold L. Rosenberg,et al.  Rapid identification of repeated patterns in strings, trees and arrays , 1972, STOC.

[14]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[15]  G. N. Raney.  Functional composition patterns and power series reversion , 1960 .

[16]  John W. Moon,et al.  On the Order of Random Channel Networks , 1980, SIAM J. Matrix Anal. Appl..

[17]  Alfred V. Aho,et al.  The design and analysis of algorithms , 1974 .

[18]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[19]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[20]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[21]  N. D. Bruijn.  Asymptotic methods in analysis , 1958 .

[22]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[23]  de Ng Dick Bruijn,et al.  THE AVERAGE HEIGHT OF PLANTED PLANE TREES , 1972 .

[24]  J. Moon,et al.  On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.