Skip to main content
SpringerLink
Log in

Number of Pairs of Template Matchings in q-ary Tree with Randomly Marked Vertices

  • Conference paper
  • First Online:
Analytical and Computational Methods in Probability Theory (ACMPT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10684))

Abstract

Let the vertices of a complete q-ary tree be assigned independent random marks having uniform distribution on a finite alphabet. We consider pairs of identically marked embeddings of a given subtree template. An asymptotic formula for the expectation of the number of such pairs is obtained and the Poisson limit theorem for this number is proposed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Erhardsson, T.: Stein’s method for Poisson and compound Poisson approximation. In: Barbour, A.D., Chen, L.H.Y. (eds.) An Introduction to Stein’s Method, pp. 61–113. Singapore University Press, Singapore (2005)

    Chapter  Google Scholar 

  2. Guibas, L.J., Odlyzko, A.M.: Long repetitive patterns in random sequences. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 53, 241–262 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hoffmann, C.M., O’Donnell, M.J.: Pattern matching in trees. J. ACM 29(1), 68–95 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Karlin, S., Ost, F.: Counts of long aligned word matches among random letter sequences. Adv. Appl. Probab. 19(2), 293–351 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Karnin, E.D.: The first repetition of a pattern in a symmetric Bernoulli sequence. J. Appl. Probab. 20(3), 413–418 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mikhailov, V.G.: Estimate of the accuracy of the compound Poisson approximation for the distribution of the number of matching patterns. Theory Probab. Appl. 46(4), 667–675 (2002)

    Article  Google Scholar 

  7. Mikhailov, V.G.: Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain. Discrete Math. Appl. 26(2), 105–113 (2016)

    MathSciNet  Google Scholar 

  8. Mikhailov, V.G.: On the probability of existence of substrings with the same structure in a random sequence. Discrete Math. Appl. 27(6), 377–386 (2017)

    Article  Google Scholar 

  9. Rowland, E.S.: Pattern avoidance in binary trees. J. Comb. Theory Ser. A 117, 741–758 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Steyaert, J.-M., Flajolet, P.: Patterns and pattern-matching in trees: an analysis. Inf. Control 58(1), 19–58 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zubkov, A.M., Mikhailov, V.G.: Limit distributions of random variables connected with long duplications in a sequence of independent trials. Theory Probab. Appl. 19(1), 172–179 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  12. Zubkov, A.M., Kruglov, V.I.: On coincidences of tuples in a binary tree with random labels of vertices. Discrete Math. Appl. 26(3), 145–153 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mott, R.F., Kirkwood, T.B.L., Curnow, R.N.: An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences. Bull. Math. Biol. 52(6), 773–784 (1990)

    Article  MATH  Google Scholar 

  14. Singh, G., Smolka, S.A., Ramakrishnan, I.V.: Distributed algorithms for tree pattern matching. In: van Leeuwen, J. (ed.) WDAG 1987. LNCS, vol. 312, pp. 92–107. Springer, Heidelberg (1988). https://doi.org/10.1007/BFb0019797

    Chapter  Google Scholar 

Download references

Acknowledgments

This work is supported by the Russian Science Foundation under grant no. 14-50-00005.

Author information

Authors and Affiliations

  1. Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia

    Vasiliy Kruglov & Andrey Zubkov

Authors
  1. Vasiliy Kruglov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrey Zubkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrey Zubkov .

Editor information

Editors and Affiliations

  1. Department of Applied Probability and Informatics, RUDN University, Moscow, Russia

    Vladimir V. Rykov

  2. City University of Hong Kong, Hong Kong, Hong Kong

    Nozer D. Singpurwalla

  3. Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia

    Andrey M. Zubkov

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kruglov, V., Zubkov, A. (2017). Number of Pairs of Template Matchings in q-ary Tree with Randomly Marked Vertices. In: Rykov, V., Singpurwalla, N., Zubkov, A. (eds) Analytical and Computational Methods in Probability Theory. ACMPT 2017. Lecture Notes in Computer Science(), vol 10684. Springer, Cham. https://doi.org/10.1007/978-3-319-71504-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71504-9_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71503-2

  • Online ISBN: 978-3-319-71504-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation