The following pages link to Gabriele Fici (Q243831):
Displaying 50 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- Square-free words with one possible mismatch (Q297663) (← links)
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Automata and differentiable words (Q442244) (← links)
- Vertical representation of \(\mathbf{C}^\infty\)-words (Q482290) (← links)
- Algorithms for computing abelian periods of words (Q496544) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- Cyclic complexity of words (Q507796) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- On prefix normal words and prefix normal forms (Q729994) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- \((k,\lambda)\)-anti-powers and other patterns in words (Q1630893) (← links)
- Algorithms for anti-powers in strings (Q1641162) (← links)
- Universal partial words over non-binary alphabets (Q1694683) (← links)
- Anti-powers in infinite words (Q1747764) (← links)
- Sturmian numeration systems and decompositions to palindromes (Q1750221) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Enumeration and structure of trapezoidal words (Q1935783) (← links)
- Abelian antipowers in infinite words (Q2002043) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Constructing antidictionaries of long texts in output-sensitive space (Q2048208) (← links)
- On the Lie complexity of Sturmian words (Q2089692) (← links)
- On the longest common subsequence of Thue-Morse words (Q2203606) (← links)
- New bounds on antipowers in words (Q2203608) (← links)
- On the least number of palindromes in two-dimensional words (Q2286748) (← links)
- Pseudo-solutions of word equations (Q2304544) (← links)
- On sets of words of rank two (Q2333030) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- Rich square-free words (Q2357378) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- The sequence of open and closed prefixes of a Sturmian word (Q2363308) (← links)
- Normalization of ternary generalized pseudostandard words (Q2420613) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- Binary jumbled string matching for highly run-length compressible texts (Q2444848) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- Generalized de Bruijn words for primitive words and powers (Q2515571) (← links)
- On the structure of bispecial Sturmian words (Q2637643) (← links)
- Primitive sets of words (Q2662680) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- Adaptive learning of compressible strings (Q2664947) (← links)
- Properties of a class of Toeplitz words (Q2672565) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- A classification of trapezoidal words (Q2789522) (← links)
- On the Number of Closed Factors in a Word (Q2799189) (← links)
