Titlebook: Combinatorics on Words; 14th International C Anna Frid,Robert Mercaş Conference proceedings 2023 The Editor(s) (if applicable) and The Auth

Definitive

Markku Mikkola,Ari Jussila,Tapani Ryynänene extend their result by constructing a smallest string attractor for any given factor of the Thue-Morse word. In particular, we show that these string attractors have size at most 5 and that this upper bound is sharp.

摸索

绝食

dagger

climax

https://doi.org/10.1007/978-3-031-39206-1very. Intuitively, the CDAWG of a string . is obtained by merging isomorphic subtrees of the suffix tree [Weiner 1973] of the same string ., thus CDAWGs are a compact indexing structure. In this paper, we investigate the sensitivity of CDAWGs when a single character edit operation (insertion, deleti

粘土

失误

Rodent

惊呼

煞费苦心

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230057.jpg