Marinella Sciortino

CoRR, 2022

String Attractors and Infinite Words.

[BibT_eX]

[DOI]

Giuseppe Romana

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

Burrows-Wheeler Transform on Purely Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

2021

A combinatorial view on string attractors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Computing the Original eBWT Faster, Simpler, and with Less Memory.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

r-Indexing the eBWT.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020

The Alternating BWT: An algorithmic perspective.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Variable-order reference-free variant discovery with the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

BMC Bioinform., 2020

2019

The effects of mental rotation on computational thinking.

[BibT_eX]

[DOI]

Comput. Educ., 2019

SNPs detection by eBWT positional clustering.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2019

Inducing the Lyndon Array.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

String Attractors and Combinatorics on Words.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

A New Class of Searchable and Provably Highly Compressible String Transformations.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Detecting Mutations by eBWT.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

The Colored Longest Common Prefix Array Computed via Sequential Scans.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Block Sorting-Based Transformations on Words: Beyond the Magic BWT.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Measuring the clustering effect of BWT via RLE.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Preface.

[BibT_eX]

[DOI]

Mariangiola Dezani

Math. Struct. Comput. Sci., 2017

Cyclic complexity of words.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2017

On Fixed Points of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Burrows-Wheeler Transform and Run-Length Enconding.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Lightweight LCP construction for very large collections of strings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

2015

Standard Sturmian words and automata minimization algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2014

Suffix array and Lyndon factorization of a text.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Sorting conjugates and Suffixes of Words in a Multiset.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Epichristoffel Words and Minimization of Moore Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Universal Lyndon Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Sorting Suffixes of a Text via its Lyndon Factorization.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Suffixes, Conjugates and Lyndon Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Words, Trees and Automata Minimization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words.

[BibT_eX]

[DOI]

Giovanna Rosone

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Nondeterministic Moore automata and Brzozowski's minimization algorithm.

[BibT_eX]

[DOI]

Giuseppa Castiglione

Theor. Comput. Sci., 2012

Lightweight LCP Construction for Next-Generation Sequencing Datasets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011

Hopcroft's algorithm and tree-like automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Nondeterministic Moore Automata and Brzozowski's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2011

2010

On extremal cases of Hopcroft's algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A Challenging Family of Automata for Classical Minimization Algorithms.

[BibT_eX]

[DOI]

Cyril Nicaud

Proceedings of the Implementation and Application of Automata, 2010

2009

Circular sturmian words and Hopcroft's algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

2008

A New Combinatorial Approach to Sequence Comparison.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Distance measures for biological sequences: Some recent approaches.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2008

Hopcroft's Algorithm and Cyclic Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

2007

An extension of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Theor. Comput. Sci., 2007

Languages with mismatches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Suffix Automata and Standard Sturmian Words.

[BibT_eX]

[DOI]

Luca Q. Zamboni

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Word assembly through minimal forbidden words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Boosting textual compression in optimal linear time.

[BibT_eX]

[DOI]

J. ACM, 2005

An Extension of the Burrows Wheeler Transform to k Words.

[BibT_eX]

[DOI]

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2003

Burrows-Wheeler transform and Sturmian words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Computing forbidden words of regular languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

Indexing Structures for Approximate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Words and forbidden factors.

[BibT_eX]

[DOI]

Filippo Mignosi

Theor. Comput. Sci., 2002

2001

Forbidden Factors and Fragment Assembly.

[BibT_eX]

[DOI]

Filippo Mignosi

RAIRO Theor. Informatics Appl., 2001

2000

Forbidden Words in Symbolic Dynamics.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2000

1999

Forbidden Factors in Finite and Infinite Words.

[BibT_eX]

Filippo Mignosi