Skip to main content
SpringerLink
Log in

A note on the longest matching consecutive subsequence

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

Abstract

The longest matching consecutive subsequence plays an important role in information theory and molecular biology. We consider the Hausdorff dimension of the set of points whose rate of growth of the longest matching consecutive subsequence is almost equal to a class of monotonically increasing functions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arratia, R., Waterman, M.S.: An Erdős–Rényi law with shifts. Adv. Math. 55, 13–23 (1985)

    Article  MathSciNet  Google Scholar 

  2. Barreira, L., Saussol, B., Schmeling, J.: Distribution of frequencies of digits via multifractal analysis. J. Number Theory 97, 410–438 (2002)

    Article  MathSciNet  Google Scholar 

  3. Bishop, C., Peres, Y.: Fractal Sets in Probability and Analysis. Cambridge Studies in Advanced Mathematics 162. Cambridge University Press, Cambridge (2017)

    Book  Google Scholar 

  4. Dai, Y.X., Wei, C., Wen, S.Y.: Some geometric properties of sets defined by digit restrictions. Int. J. Number Theory 13, 65–75 (2017)

    Article  MathSciNet  Google Scholar 

  5. Dajani, K., Kraaikamp, C.: Ergodic Theory of Numbers (Carus Mathematical Monographs, 29). Mathematical Association of America, Washington (2002)

    Book  Google Scholar 

  6. Erdős, P., Rényi, A.: On a new law of large numbers. J. Anal. Math. 22, 103–111 (1970)

    Article  MathSciNet  Google Scholar 

  7. Falconer, K.J.: Fractal Geometry-Mathematical Foundations and Applications. Wiley, Chichester (1990)

    Book  Google Scholar 

  8. Feng, D.-J., Wu, J.: The Hausdorff dimension of recurrent sets in symbolic spaces. Nonlinearity 14, 81–85 (2001)

    Article  MathSciNet  Google Scholar 

  9. Galambos, J.: Representations of Real Numbers by Infinite Series. Lecture Notes in Math., vol. 502. Springer, Berlin (1976)

    Book  Google Scholar 

  10. Karlin, S., Ghandour, G., Ost, F., Tavare, S., Korn, L.J.: New approaches for computer analysis of nucleic acid sequences. Proc. Natl. Acad. Sci. USA 80, 5660–5664 (1983)

    Article  Google Scholar 

  11. Li, J.J., Yang, X.F.: On longest matching consecutive subsequence. Int. J. Number Theory 8, 1745–1758 (2019)

    Article  MathSciNet  Google Scholar 

  12. Li, J.J., Wu, M.: On exceptional sets in Erdős–Rényi limit theorem revisited. Monatsh. Math. 182, 865–875 (2017)

    Article  MathSciNet  Google Scholar 

  13. Li, J.J., Wu, M., Xiong, Y.: On Assouad dimension and arithmetic progressions in sets defined by digit restrictions. J. Fourier Anal. Appl. 25, 1782–1794 (2019)

    Article  MathSciNet  Google Scholar 

  14. Olsen, L.: Hausdorff and packing dimensions of non-normal tuples of numbers: non-linearity and divergence points. Bull. Sci. Math. 134, 64–96 (2010)

    Article  MathSciNet  Google Scholar 

  15. Olsen, L.: Frequencies of digits, divergence points, and Schmidt games. Chaos Solitons Fractals 40, 2222–2232 (2009)

    Article  MathSciNet  Google Scholar 

  16. Paterson, M., Dančík, V.: Longest common subsequence. In: Prívara, I., Rovan, B., Ruzička, P. (eds.) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 841, pp. 127–142. Springer, Berlin, Heidelberg (1994)

    MATH  Google Scholar 

  17. Peng, L.: Dimension of sets of sequences defined in terms of recurrence of their prefixes. C. R. Acad. Sci. Paris Ser. I 343, 129–133 (2006)

    Article  MathSciNet  Google Scholar 

  18. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol. 147, 195–197 (1981)

    Article  Google Scholar 

  19. Zou, R.B.: Hausdorff dimension of the maximal run-length in dyadic expansion. Czechoslovak Math. J. 61, 881–888 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the referee for his/her valuable comments and suggestions that led to the improvement of the manuscript. This project was supported by the National Natural Science Foundation of China (11671189, 11771153 & 11971109) and the Natural Science Foundation of Fujian Province (2017J01403).

Author information

Authors and Affiliations

  1. School of Mathematics and Information Science, Guangzhou University, Guangzhou, 510006, People’s Republic of China

    Jinjun Li

  2. Department of Mathematics, South China University of Technology, Guangzhou, 510641, People’s Republic of China

    Min Wu

Authors
  1. Jinjun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Min Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Min Wu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, J., Wu, M. A note on the longest matching consecutive subsequence. Arch. Math. 114, 353–360 (2020). https://doi.org/10.1007/s00013-019-01401-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00013-019-01401-x

Keywords

Mathematics Subject Classification

Search

Navigation