Skip to main content
Passa alla visualizzazione normale.


Pari opportunità

GABRIELE FICI

Publications

Date Title Type Record
2023 Abelian combinatorics on words: a survey Articolo in rivista Go to
2023 Substring Complexity in Sublinear Space Contributo in atti di convegno pubblicato in volume Go to
2023 On the Impact of Morphisms on BWT-Runs Contributo in atti di convegno pubblicato in volume Go to
2022 Properties of a class of Toeplitz words Articolo in rivista Go to
2022 On the Lie complexity of Sturmian words Articolo in rivista Go to
2022 Maximal Closed Substrings Contributo in atti di convegno pubblicato in volume Go to
2021 Reverse-Safe Text Indexing Articolo in rivista Go to
2021 Primitive sets of words Articolo in rivista Go to
2021 Constructing Antidictionaries of Long Texts in Output-Sensitive Space Articolo in rivista Go to
2021 Adaptive learning of compressible strings Articolo in rivista Go to
2020 Generating a Gray code for prefix normal words in amortized polylogarithmic time per word Articolo in rivista Go to
2020 Preface Prefazione/Postfazione Go to
2020 Reverse-Safe Data Structures for Text Indexing Contributo in atti di convegno pubblicato in volume Go to
2019 Minimal forbidden factors of circular words Articolo in rivista Go to
2019 On Sets of Words of Rank Two Contributo in atti di convegno pubblicato in volume Go to
2019 Abelian antipowers in infinite words Articolo in rivista Go to
2019 Constructing Antidictionaries in Output-Sensitive Space Contributo in atti di convegno pubblicato in volume Go to
2019 Minimal Absent Words in Rooted and Unrooted Trees Contributo in atti di convegno pubblicato in volume Go to
2018 Bacteria classification using minimal absent words Articolo in rivista Go to
2018 Algorithms for anti-powers in strings Articolo in rivista Go to
2018 Alignment-free sequence comparison using absent words Articolo in rivista Go to
2018 Anti-powers in infinite words Articolo in rivista Go to
2017 Abelian-square-rich words Articolo in rivista Go to
2017 Cyclic complexity of words Articolo in rivista Go to
2017 Minimal forbidden factors of circular words Capitolo o Saggio Go to
2017 Open and Closed Words Articolo in rivista Go to
2017 Preface Prefazione/Postfazione Go to
2017 The sequence of open and closed prefixes of a Sturmian word Articolo in rivista Go to
2017 On prefix normal words and prefix normal forms Articolo in rivista Go to
2016 Anti-powers in infinite words Capitolo o Saggio Go to
2016 Fast computation of abelian runs Articolo in rivista Go to
2016 Linear-time sequence comparison using minimal absent words & applications Capitolo o Saggio Go to
2016 On the greedy algorithm for the Shortest Common Superstring problem with reversals Articolo in rivista Go to
2016 A note on easy and efficient computation of full abelian periods of a word Articolo in rivista Go to
2016 Abelian powers and repetitions in Sturmian words Articolo in rivista Go to
2015 Factorizations of the Fibonacci infinite word Articolo in rivista Go to
2015 Vertical representation of C∞-words Articolo in rivista Go to
2015 Online Computation of Abelian Runs Contributo in atti di convegno pubblicato in volume Go to
2015 On the Number of Closed Factors in a Word Contributo in atti di convegno pubblicato in volume Go to
2015 Words with the maximum number of abelian squares Contributo in atti di convegno pubblicato in volume Go to
2014 On The Maximum Number of Abelian Squares in a Word Contributo in atti di convegno pubblicato in rivista Go to
2014 Algorithms for computing Abelian periods of words Articolo in rivista Go to
2014 A subquadratic algorithm for minimum palindromic factorization Articolo in rivista Go to
2014 Cyclic complexity of words Capitolo o Saggio Go to
2014 On Combinatorial Generation of Prefix Normal Words Capitolo o Saggio Go to
2014 Splicing Systems from Past to Future: Old and New Challenges Capitolo o Saggio Go to
2014 Universal Lyndon Words Capitolo o Saggio Go to
2014 On the structure of bispecial Sturmian words Articolo in rivista Go to
2014 Normal, Abby Normal, Prefix Normal Capitolo o Saggio Go to
2013 Open and Closed Prefixes of Sturmian Words eedings Go to
2013 On the least number of palindromes contained in an infinite word Articolo in rivista Go to
2013 Binary jumbled string matching for highly run-length compressible texts Articolo in rivista Go to
2013 Abelian Repetitions in Sturmian Words eedings Go to
2013 Enumeration and structure of trapezoidal words Articolo in rivista Go to
2012 ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS Articolo in rivista Go to
2012 Topological Properties of Cellular Automata on Trees eedings Go to
2012 Automata and differentiable words Articolo in rivista Go to
2012 On Approximate Jumbled Pattern Matching in Strings Articolo in rivista Go to
2012 On The Least Number of Palindromes in an Infinite Word eedings Go to
2012 Quasi-Linear Time Computation of the Abelian Periods of a Word eedings Go to
2012 A Characterization of Bispecial Sturmian Words Capitolo o Saggio Go to
2011 Special factors and the combinatorics of suffix and factor automata Articolo in rivista Go to
2011 On Prefix Normal Words Capitolo o Saggio Go to
2011 A Classification of Trapezoidal Words eedings Go to
2011 Computing Abelian Periods in Words eedings Go to
2010 Some Remarks on Differentiable Sequences and Recursivity Articolo in rivista Go to
2010 On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching Capitolo o Saggio Go to
2010 On the regularity of circular splicing languages: a survey and new developments Articolo in rivista Go to
2009 Searching for Jumbled Patterns in Strings eedings Go to
2009 A characterization of regular circular languages generated by marked splicing systems Articolo in rivista Go to
2009 Combinatorics of Finite Words and Suffix Automata Capitolo o Saggio Go to
2007 Marked Systems and Circular Splicing Capitolo o Saggio Go to
2006 Word assembly through minimal forbidden words Articolo in rivista Go to
2005 Presentations of Constrained Systems With Unconstrained Positions Articolo in rivista Go to
2004 Fragment assembly through minimal forbidden words eedings Go to