Giovanni Manzini

IEEE Access, 2024

Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests.

[BibT_eX]

[DOI]

Dominika Draesslerová

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Generalization of Repetitiveness Measures for Two-Dimensional Strings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2024

The Rational Construction of a Wheeler DFA.

[BibT_eX]

[DOI]

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

Computing the LCP Array of a Labeled Graph.

[BibT_eX]

[DOI]

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

2023

A new class of string transformations for compressed text indexing.

[BibT_eX]

[DOI]

Inf. Comput., October, 2023

Suffixient Sets.

[BibT_eX]

[DOI]

CoRR, 2023

Compressibility Measures for Two-Dimensional Data.

[BibT_eX]

[DOI]

Lorenzo Carfagna

Proceedings of the String Processing and Information Retrieval, 2023

Computing matching statistics on Wheeler DFAs.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2023

2022

Efficient and compact representations of some non-canonical prefix-free codes.

[BibT_eX]

[DOI]

Alberto Ordóñez Pereira

Theor. Comput. Sci., 2022

Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Teaching the Burrows-Wheeler Transform via the Positional Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Marinella Sciortino

CoRR, 2022

Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs.

[BibT_eX]

[DOI]

Felipe A. Louza

Algorithmica, 2022

Compressing and Querying Integer Dictionaries Under Linearities and Repetitions.

[BibT_eX]

[DOI]

Giorgio Vinciguerra

IEEE Access, 2022

2021

EZcount: An all-in-one software for microRNA expression quantification from NGS sequencing data.

[BibT_eX]

[DOI]

Filippo Geraci

Comput. Biol. Medicine, 2021

Compressing and Indexing Aligned Readsets.

[BibT_eX]

[DOI]

Garance Gourdel

Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021

Repetition- and Linearity-Aware Rank/Select Dictionaries.

[BibT_eX]

[DOI]

Giorgio Vinciguerra

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Efficiently Merging r-indexes.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

PHONI: Streamed Matching Statistics with Multi-Genome References.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

PFP Compressed Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020

The Alternating BWT: An algorithmic perspective.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Lightweight merging of compressed indices based on BWT variants.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Matching Reads to Many Genomes with the r-Index.

[BibT_eX]

[DOI]

J. Comput. Biol., 2020

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.

[BibT_eX]

[DOI]

J. Comput. Biol., 2020

PFP Data Structures.

[BibT_eX]

[DOI]

CoRR, 2020

Practical Random Access to SLP-Compressed Texts.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

Yoshimasa Takabatake

Proceedings of the String Processing and Information Retrieval, 2020

2019

A compact index for order-preserving pattern matching.

[BibT_eX]

[DOI]

Gianni Decaroli

Softw. Pract. Exp., 2019

25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Tree-Shape Grammars for Random Access.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

Yoshimasa Takabatake

CoRR, 2019

External memory BWT and LCP computation for sequence collections with applications.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2019

Prefix-free parsing for building big BWTs.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2019

Inducing the Lyndon Array.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Rpair: Rescaling RePair with Rsync.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Space-Efficient Merging of Succinct de Bruijn Graphs.

[BibT_eX]

[DOI]

Felipe A. Louza

Proceedings of the String Processing and Information Retrieval, 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

Lyndon array construction during Burrows-Wheeler inversion.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Prefix-Free Parsing for Building Big BWTs.

[BibT_eX]

[DOI]

CoRR, 2018

STAble: a novel approach to de novo assembly of RNA-seq data and its application in a metabolic model network based metatranscriptomic workflow.

[BibT_eX]

[DOI]

BMC Bioinform., 2018

Prefix-Free Parsing for Building Big BWTs.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 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

Wheeler graphs: A framework for BWT-based data structures.

[BibT_eX]

[DOI]

Jouni Sirén

Theor. Comput. Sci., 2017

Compressed Spaced Suffix Arrays.

[BibT_eX]

[DOI]

Daniel Valenzuela

Math. Comput. Sci., 2017

Lightweight BWT and LCP Merging via the Gap Algorithm.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

An Encoding for Order-Preserving Matching.

[BibT_eX]

[DOI]

Rossano Venturini

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Wheeler Graphs: Variations on a Theme by Burrows and Wheeler.

[BibT_eX]

[DOI]

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

2016

Dictionary-Based Data Compression.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Boosting Textual Compression.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

From H&M to Gap for Lightweight BWT Merging.

[BibT_eX]

[DOI]

CoRR, 2016

Toward a Succinct Index for Order-Preserving Pattern Matching.

[BibT_eX]

[DOI]

CoRR, 2016

Compressing and Indexing Stock Market Data.

[BibT_eX]

[DOI]

Gianni Decaroli

CoRR, 2016

XBWT Tricks.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes.

[BibT_eX]

[DOI]

Alberto Ordóñez Pereira

Proceedings of the String Processing and Information Retrieval, 2016

2015

Multiple seeds sensitivity using a single seed with threshold.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2015

Longest Common Prefix with Mismatches.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Relative Select.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

2014

Design and analysis of periodic multiple seeds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Spaced Seed Design Using Perfect Rulers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Reusing an FM-index.

[BibT_eX]

[DOI]

Jouni Sirén

CoRR, 2014

Relative FM-Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2014

2013

Foreword.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Theor. Comput. Sci., 2013

Better spaced seeds using Quadratic Residues.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

2012

Lightweight Data Indexing and Compression in External Memory.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Spaced Seeds Design Using Perfect Rulers.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2011

2010

Move-to-Front, Distance Coding, and Inversion Frequencies revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On compressing the textual web.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

2009

Compressing and indexing labeled trees, with applications.

[BibT_eX]

[DOI]

J. ACM, 2009

The myriad virtues of Wavelet Trees.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Inf. Comput., 2009

Succinct Representations of Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Permuted Longest-Common-Prefix Array.

[BibT_eX]

[DOI]

Juha Kärkkäinen

Simon J. Puglisi

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

Dictionary-Based Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Boosting Textual Compression.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007

Foreword.

[BibT_eX]

[DOI]

S. Muthukrishnan

Theor. Comput. Sci., 2007

Compressed representations of sequences and full-text indexes.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.

[BibT_eX]

[DOI]

BMC Bioinform., 2007

Space-Conscious Compression.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Compressing and searching XML data via two zips.

[BibT_eX]

[DOI]

Proceedings of the 15th international conference on World Wide Web, 2006

The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Proceedings of the Algorithms, 2006

2005

Indexing compressed text.

[BibT_eX]

[DOI]

J. ACM, 2005

Boosting textual compression in optimal linear time.

[BibT_eX]

[DOI]

J. ACM, 2005

Structuring labeled trees for optimal succinctness, and beyond.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

A simple and fast DNA compressor.

[BibT_eX]

[DOI]

Marcella Rastero

Softw. Pract. Exp., 2004

Engineering a Lightweight Suffix Array Construction Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2004

Two Space Saving Tricks for Linear Time LCP Array Computation.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

An Alphabet-Friendly FM-Index.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2004

Compression boosting in optimal linear time using the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

On computing the entropy of cellular automata.

[BibT_eX]

[DOI]

Michele d'Amico

Theor. Comput. Sci., 2003

2001

Inversion of circulant matrices over Zm.

[BibT_eX]

[DOI]

Math. Comput., 2001

An analysis of the Burrows-Wheeler transform.

[BibT_eX]

[DOI]

J. ACM, 2001

An experimental study of a compressed index.

[BibT_eX]

[DOI]

Inf. Sci., 2001

An experimental study of an opportunistic index.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Ergodicity, transitivity, and regularity for linear cellular automata over Zm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Opportunistic Data Structures with Applications.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Parallel Complexity of Numerically Accurate Linear System Solvers.

[BibT_eX]

[DOI]

Mauro Leoncini

SIAM J. Comput., 1999

Compression of Low Entropy Strings with Lempel-Ziv Algorithms.

[BibT_eX]

[DOI]

S. Rao Kosaraju

SIAM J. Comput., 1999

Attractors of Linear Cellular Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

Finding Exact Solutions to the Bandwidth Minimization Problem.

[BibT_eX]

[DOI]

Gianna M. Del Corso

Computing, 1999

Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Efficient Algorithms foe On-Line Symbol Ranking Compression.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Invertible Linear Cellular Automata over Zm: Algorithmic and Dynamical Aspects.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Lyapunov Exponents versus Expansivity and Sensitivity in Cellular Automata.

[BibT_eX]

[DOI]

Michele Finelli

J. Complex., 1998

Lower bounds for sparse matrix vector multiplication on hypercubic networks.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 1998

Attractors of D-dimensional Linear Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates.

[BibT_eX]

[DOI]

Gianna M. Del Corso

J. Complex., 1997

On Ergodic Linear Cellular Automata over Zm.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

On the Parallel Complexity of Matrix Factorization Algorithms.

[BibT_eX]

[DOI]

Mauro Leoncini

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

On the Ordering of Sparse Linear Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1996

Parallel Complexity of Householder QR Factorization.

[BibT_eX]

[DOI]

Mauro Leoncini

Proceedings of the Algorithms, 1996

Lyapunov Exponents Vs Expansivity and Sensitivity in Cellular Automata.

[BibT_eX]

[DOI]

Michele Finelli

Proceedings of the ACRI '96, 1996

1995

Algebraic Techniques in Communication Complexity.

[BibT_eX]

[DOI]

Bruno Codenotti

Inf. Process. Lett., 1995

BIDA: An Improved Perimeter Search Algorithm.

[BibT_eX]

[DOI]

Artif. Intell., 1995

1994

sparse Matrix Computations on the Hypercube and Related Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

1993

Global Strategies for Augmenting the Efficiency of TSP Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1991

Large Sorting and Routing Problems on the Hypercube and Related Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1991

Searching graphs using mixed strategies.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1991

Radix Sort on the Hypercube.

[BibT_eX]

[DOI]