Common substring with shifts in b-ary expansions

被引：0
|
作者：
Liao, Xin [1 ]
Yu, Dingding [1 ]
机构：
[1] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China
来源：
ARCHIV DER MATHEMATIK | 2024年 / 123卷 / 04期
关键词：
b-ary expansions; Common substring with shifts; Hausdorff dimension;
D O I：
10.1007/s00013-024-02038-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Denote by S-n(x,y) the length of the longest common substring of x and y with shifts in their first n digits of the b-ary expansions. We show that the sets of pairs (x, y), for which the growth rate of S-n(x,y) is alpha log n with 0 <= alpha <= infinity, have full Hausdorff dimension. Our method relies upon some estimation of the spectral radius of matrices.
引用
收藏
页码：369 / 377
页数：9
相关论文
共 50 条
  • [31] Quantum Algorithms for Longest Common Substring with a Gap
    Gibney, Daniel
    Hossen, Md Helal
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2024, 2025, 14899 : 143 - 158
  • [32] Longest Common Substring Made Fully Dynamic
    Amir, Amihood
    Charalampopoulos, Panagiotis
    Pissis, Solon P.
    Radoszewski, Jakub
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [33] Longest Common Substring with Approximately k Mismatches
    Tomasz Kociumaka
    Jakub Radoszewski
    Tatiana Starikovskaya
    Algorithmica, 2019, 81 : 2633 - 2652
  • [34] Computing the longest common substring with one mismatch
    M. A. Babenko
    T. A. Starikovskaya
    Problems of Information Transmission, 2011, 47 : 28 - 33
  • [35] The average common substring approach to phylogenomic reconstruction
    Ulitsky, I
    Burstein, D
    Tuller, T
    Chor, B
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (02) : 336 - 350
  • [36] Computing the longest common substring with one mismatch
    Babenko, M. A.
    Starikovskaya, T. A.
    PROBLEMS OF INFORMATION TRANSMISSION, 2011, 47 (01) : 28 - 33
  • [37] Correction to: Longest Common Substring with Approximately k Mismatches
    Tomasz Kociumaka
    Jakub Radoszewski
    Tatiana Starikovskaya
    Algorithmica, 2019, 81 : 3074 - 3074
  • [38] A parallel algorithm for longest common substring of multiple biosequences
    Liu, Wei
    Chen, Ling
    DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 13 - 17
  • [39] Sublinear Space Algorithms for the Longest Common Substring Problem
    Kociumaka, Tomasz
    Starikovskaya, Tatiana
    Vildhoj, Hjalte Wedel
    ALGORITHMS - ESA 2014, 2014, 8737 : 605 - 617
  • [40] Longest common substring for random subshifts of finite type
    Rousseau, Jerome
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2021, 57 (03): : 1768 - 1785
12345