Giovanna Rosone

Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering Problem.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

phyBWT2: phylogeny reconstruction via eBWT positional clustering.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., December, 2023

A new class of string transformations for compressed text indexing.

[BibT_eX]

[DOI]

Inf. Comput., October, 2023

Computing the optimal BWT of very large string collections.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2023

2022

Elastic-Degenerate String Matching via Fast Matrix Multiplication.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

Parallel Lossy Compression for Large FASTQ Files.

[BibT_eX]

[DOI]

Felipe A. Louza

Proceedings of the Biomedical Engineering Systems and Technologies, 2022

Lossy Compressor Preserving Variant Calling through Extended BWT.

[BibT_eX]

[DOI]

Felipe A. Louza

Proceedings of the 15th International Joint Conference on Biomedical Engineering Systems and Technologies, 2022

2021

Combinatorial Algorithms for String Sanitization.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2021

Space-efficient construction of compressed suffix trees.

[BibT_eX]

[DOI]

Nicola Prezza

Theor. Comput. Sci., 2021

A combinatorial view on string attractors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2020

The Alternating BWT: An algorithmic perspective.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Approximate pattern matching on elastic-degenerate text.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Longest property-preserved common factor: A new string-processing framework.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Comparing Degenerate Strings.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

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

[BibT_eX]

[DOI]

BMC Bioinform., 2020

Metagenomic analysis through the extended Burrows-Wheeler transform.

[BibT_eX]

[DOI]

Felipe A. Louza

BMC Bioinform., 2020

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

Faster Online Computation of the Succinct Longest Previous Factor Array.

[BibT_eX]

[DOI]

Nicola Prezza

Proceedings of the Beyond the Horizon of Computability, 2020

2019

SNPs detection by eBWT positional clustering.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2019

Online Algorithms on Antipowers and Antiperiods.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

String Sanitization: A Combinatorial Approach.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

String Attractors and Combinatorics on Words.

[BibT_eX]

[DOI]

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

Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Nicola Prezza

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 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

Lightweight Metagenomic Classification via eBWT.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018

Detecting Mutations by eBWT.

[BibT_eX]

[DOI]

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

Degenerate String Comparison and Applications.

[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

Longest Property-Preserved Common Factor.

[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

On Fixed Points of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Pattern Matching on Elastic-Degenerate Text with Errors.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

Burrows-Wheeler Transform and Run-Length Enconding.

[BibT_eX]

[DOI]

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

On-Line Pattern Matching on Similar Texts.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Lightweight LCP construction for very large collections of strings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

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

Adaptive reference-free compression of sequence quality scores.

[BibT_eX]

[DOI]

Lilian Janin

Anthony J. Cox

Bioinform., 2014

2013

Lightweight algorithms for constructing and inverting the BWT of string collections.

[BibT_eX]

[DOI]

Markus J. Bauer

Anthony J. Cox

Theor. Comput. Sci., 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

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

[BibT_eX]

[DOI]

Marinella Sciortino

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

2012

On the product of balanced sequences.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform.

[BibT_eX]

[DOI]

Bioinform., 2012

Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes.

[BibT_eX]

[DOI]

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

Lightweight LCP Construction for Next-Generation Sequencing Datasets.

[BibT_eX]

[DOI]

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

2011

Balancing and clustering of words in the Burrows-Wheeler transform.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Lightweight BWT Construction for Very Large String Collections.

[BibT_eX]

[DOI]

Markus J. Bauer

Anthony J. Cox

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2009

Burrows-Wheeler transform and palindromic richness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On Balancing of a Direct Product.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Balanced Words Having Simple Burrows-Wheeler Transform.

[BibT_eX]

[DOI]