Zsuzsanna Lipták

Simon J. Puglisi

Algorithms Mol. Biol., December, 2024

r-indexing the eBWT.

[BibT_eX]

[DOI]

Inf. Comput., 2024

A simpler data structure for dynamic strings.

[BibT_eX]

[DOI]

CoRR, 2024

Fast Matching Statistics for Sets of Long Similar Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2024, 2024

A BWT-Based Algorithm for Random de Bruijn Sequence Construction.

[BibT_eX]

[DOI]

Luca Parmigiani

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

A Textbook Solution for Dynamic Strings.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

BAT-LZ out of hell.

[BibT_eX]

[DOI]

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

2023

Maintaining the cycle structure of dynamic permutations.

[BibT_eX]

[DOI]

CoRR, 2023

Constant Time and Space Updates for the Sigma-Tau Problem.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Bit Catastrophes for the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Computing the optimal BWT of very large string collections.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2023

2022

When a Dollar in a Fully Clustered Word Makes a BWT.

[BibT_eX]

[DOI]

Sara Giuliani

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

On Compressing Collections of Substring Samples.

[BibT_eX]

[DOI]

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

CSTs for Terabyte-Sized Data.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

On different variants of the Burrows-Wheeler-Transform of string collections.

[BibT_eX]

[DOI]

Davide Cenzato

Proceedings of the Data Compression Conference, 2022

A Theoretical and Experimental Analysis of BWT Variants for String Collections.

[BibT_eX]

[DOI]

Davide Cenzato

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

When a dollar makes a BWT.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On infinite prefix normal words.

[BibT_eX]

[DOI]

Massimiliano Rossi

Theor. Comput. Sci., 2021

Pattern Discovery in Colored Strings.

[BibT_eX]

[DOI]

Simon J. Puglisi

Massimiliano Rossi

ACM J. Exp. Algorithmics, 2021

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

[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

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

When a Dollar Makes a BWT.

[BibT_eX]

[DOI]

Sara Giuliani

Romeo Rizzi

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

2018

Bubble-Flip - A new generation algorithm for prefix normal words.

[BibT_eX]

[DOI]

Massimiliano Rossi

Theor. Comput. Sci., 2018

Preface.

[BibT_eX]

[DOI]

Jan Kratochvíl

Eur. J. Comb., 2018

Preface.

[BibT_eX]

[DOI]

W. F. Smyth

Discret. Appl. Math., 2018

2017

On prefix normal words and prefix normal forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On the Parikh-de-Bruijn grid.

[BibT_eX]

[DOI]

Peter Burcsi

W. F. Smyth

CoRR, 2017

2016

Reconstruction of Trees from Jumbled and Weighted Subtrees.

[BibT_eX]

[DOI]

Dénes Bartha

Peter Burcsi

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

StringMasters 2012 & 2013 special issue - volume 2.

[BibT_eX]

[DOI]

Maxime Crochemore

Jacqueline W. Daykin

J. Discrete Algorithms, 2015

IWOCA 2015 in Verona, Italy.

[BibT_eX]

[DOI]

Bill Smyth

Bull. EATCS, 2015

On the Number of Closed Factors in a Word.

[BibT_eX]

[DOI]

Golnaz Badkobeh

Proceedings of the Language and Automata Theory and Applications, 2015

2014

StringMasters 2012 & 2013 special issue - volume 1.

[BibT_eX]

[DOI]

Maxime Crochemore

Jacqueline W. Daykin

J. Discrete Algorithms, 2014

Normal, Abby Normal, Prefix Normal.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On Combinatorial Generation of Prefix Normal Words.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Binary jumbled string matching for highly run-length compressible texts.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Report on StringMasters 2013.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

A Note on Words With the Smallest Number of Closed Factors

[BibT_eX]

[DOI]

Golnaz Badkobeh

CoRR, 2013

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

2012

On Approximate Jumbled Pattern Matching in Strings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

A linear algorithm for string reconstruction in the reverse complement equivalence model.

[BibT_eX]

[DOI]

Péter L. Erdös

J. Discrete Algorithms, 2012

Efficient algorithms for the periodic subgraphs mining problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Algorithms for Jumbled Pattern Matching in Strings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Binary Jumbled String Matching: Faster Indexing in Less Space

[BibT_eX]

[DOI]

CoRR, 2012

Melodic String Matching via Interval Consolidation and Fragmentation.

[BibT_eX]

[DOI]

Carl Barton

Emilios Cambouropoulos

Costas S. Iliopoulos

Proceedings of the Artificial Intelligence Applications and Innovations, 2012

2011

KABOOM! A new suffix array based algorithm for clustering expression data.

[BibT_eX]

[DOI]

Scott Hazelhurst

Bioinform., 2011

On Prefix Normal Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Efficient Reconstruction of RC-Equivalent Strings.

[BibT_eX]

[DOI]

Péter L. Erdös

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

SIRIUS: decomposing isotope patterns for metabolite identification.

[BibT_eX]

[DOI]

Bioinform., 2009

Searching for Jumbled Patterns in Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008

An overview of the wcd EST clustering tool.

[BibT_eX]

[DOI]

Bioinform., 2008

DECOMP - from interpreting Mass Spectrometry peaks to solving the Money Changing Problem.

[BibT_eX]

[DOI]

Bioinform., 2008

2007

Finding submasses in weighted strings with Fast Fourier Transform.

[BibT_eX]

[DOI]

Nikhil Bansal

Mark Cieliebak

Discret. Appl. Math., 2007

A Fast and Simple Algorithm for the Money Changing Problem.

[BibT_eX]

[DOI]

Sebastian Böcker

Algorithmica, 2007

2006

Decomposing Metabolomic Isotope Patterns.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005

Strings in proteomics and transcriptomics : algorithmic and combinatorial questions in mass spectrometry and EST clustering

[BibT_eX]

[DOI]

PhD thesis, 2005

Efficient mass decomposition.

[BibT_eX]

[DOI]

Sebastian Böcker

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a<sub>1</sub>).

[BibT_eX]

[DOI]

Sebastian Böcker

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Algorithmic complexity of protein identification: combinatorics of weighted strings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Efficient Algorithms for Finding Submasses in Weighted Strings.

[BibT_eX]

[DOI]

Nikhil Bansal

Mark Cieliebak

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

A Method for Evaluating the Quality of String Dissimilarity Measures and Clustering Algorithms for EST Clustering.

[BibT_eX]

[DOI]

Judith Zimmermann

Scott Hazelhurst

Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

2002

Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2000

Broadcasting in Complete Networks with Dynamic Edge Faults.

[BibT_eX]