Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
