On longest matching consecutive subsequence

DOI10.1142/S1793042119500970zbMath1437.11116OpenAlexW2939325193MaRDI QIDQ5232179

Jinjun Li, Xiangfeng Yang

Publication date: 30 August 2019

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042119500970

zbMATH Keywords

Hausdorff dimension\(N\)-ary expansionlongest matching consecutive subsequence

Mathematics Subject Classification ID

Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Fractals (28A80)

Related Items (3)

Best approximation of orbits in iterated function systems ⋮ Shortest distance between multiple orbits and generalized fractal dimensions ⋮ A note on the longest matching consecutive subsequence

Cites Work

• Unnamed Item
• On exceptional sets in Erdős-Rényi limit theorem revisited
• On exceptional sets in Erdős-Rényi limit theorem
• Egoroff's theorem and maximal run length
• An Erdős-Rényi law with shifts
• Representations of real numbers by infinite series
• Some dimensional results for homogeneous Moran sets
• On the shortest distance between orbits and the longest common substring problem
• A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis
• On the longest block in Lüroth expansion
• A remark on exceptional sets in Erdös-Rényi limit theorem
• On a new law of large numbers
• Hausdorff dimension of the maximal run-length in dyadic expansion
• New approaches for computer analysis of nucleic acid sequences.
• Longest common subsequences

This page was built for publication: On longest matching consecutive subsequence