Simon J. Puglisi

Orcid: 0000-0001-7668-7636

Affiliations:
  • University of Helsinki, Finland


According to our database1, Simon J. Puglisi authored at least 153 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Suffix sorting via matching statistics.
Algorithms Mol. Biol., December, 2024

Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences.
Algorithmica, March, 2024

Height-bounded Lempel-Ziv encodings.
CoRR, 2024

2023
String inference from longest-common-prefix array.
Theor. Comput. Sci., 2023

Themisto: a scalable colored <i>k</i>-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes.
Bioinform., 2023

Simple Runs-Bounded FM-Index Designs Are Fast.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Hierarchical Relative Lempel-Ziv Compression.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Subset Wavelet Trees.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Longest Common Prefix Arrays for Succinct k-Spectra.
Proceedings of the String Processing and Information Retrieval, 2023

Small Searchable <i>κ</i>-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
Space-Efficient Indexing of Spaced Seeds for Accurate Overlap Computation of Raw Optical Mapping Data.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Fast and Simple Compact Hashing via Bucketing.
Algorithmica, 2022

Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads.
Proceedings of the String Processing and Information Retrieval, 2022

Maximal Closed Substrings.
Proceedings of the String Processing and Information Retrieval, 2022

Computing Longest (Common) Lyndon Subsequences.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

On Compressing Collections of Substring Samples.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

On Dynamic Bitvector Implementations.
Proceedings of the Data Compression Conference, 2022

2021
Succinct dynamic de Bruijn graphs.
Bioinform., August, 2021

Tight upper and lower bounds on suffix tree breadth.
Theor. Comput. Sci., 2021

Pattern Discovery in Colored Strings.
ACM J. Exp. Algorithmics, 2021

Block trees.
J. Comput. Syst. Sci., 2021

Document Retrieval Hacks.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

Smaller RLZ-Compressed Suffix Arrays.
Proceedings of the 31st Data Compression Conference, 2021

On Elias-Fano for Rank Queries in FM-Indexes.
Proceedings of the 31st Data Compression Conference, 2021

Weighted Ancestors in Suffix Trees Revisited.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Fast and accurate correction of optical mapping data via spaced seeds.
Bioinform., 2020

More Time-Space Tradeoffs for Finding a Shortest Unique Substring.
Algorithms, 2020

Lempel-Ziv-Like Parsing in Small Space.
Algorithmica, 2020

Relative Lempel-Ziv Compression of Suffix Arrays.
Proceedings of the String Processing and Information Retrieval, 2020

Fast Indexes for Gapped Pattern Matching.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
Kohdista: an efficient method to index and query possible Rmap alignments.
Algorithms Mol. Biol., 2019

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice.
Algorithmica, 2019

Succinct BWT-Based Sequence Prediction.
Proceedings of the Database and Expert Systems Applications, 2019

On Lempel-Ziv Decompression in Small Space.
Proceedings of the Data Compression Conference, 2019

Computing the Antiperiod(s) of a String.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Editorial: Special Issue on "Combinatorial Algorithms" (IWOCA 2016).
Theory Comput. Syst., 2018

Algorithms for anti-powers in strings.
Inf. Process. Lett., 2018

m-Bonsai: A Practical Compact Dynamic Trie.
Int. J. Found. Comput. Sci., 2018

Bidirectional Variable-Order de Bruijn Graphs.
Int. J. Found. Comput. Sci., 2018

Assembling Omnitigs using Hidden-Order de Bruijn Graphs.
CoRR, 2018

Relative Suffix Trees.
Comput. J., 2018

A Succinct Solution to Rmap Alignment.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Run Compressed Rank/Select for Large Alphabets.
Proceedings of the 2018 Data Compression Conference, 2018

Hybrid Indexing Revisited.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Block Graphs in Practice.
Math. Comput. Sci., 2017

Document retrieval on repetitive string collections.
Inf. Retr. J., 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
CoRR, 2017

Succinct colored de Bruijn graphs.
Bioinform., 2017

emMAW: computing minimal absent words in external memory.
Bioinform., 2017

Disentangled Long-Read De Bruijn Graphs via Optical Maps.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Dynamic Succinct Data Structures and Compressed Random Access Memory.
Proceedings of the Prague Stringology Conference 2017, 2017

On the Size of Lempel-Ziv and Lyndon Factorizations.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Suffix Tree Breadth.
Proceedings of the String Processing and Information Retrieval, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
Proceedings of the String Processing and Information Retrieval, 2017

Scalable Similarity Search for Molecular Descriptors.
Proceedings of the Similarity Search and Applications - 10th International Conference, 2017

Compact Dynamic Rewritable (CDRW) Arrays.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Engineering External Memory Induced Suffix Sorting.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Lempel-Ziv Compression.
Encyclopedia of Algorithms, 2016

Foreword.
Theor. Comput. Sci., 2016

Lazy Lempel-Ziv Factorization Algorithms.
ACM J. Exp. Algorithmics, 2016

Closed factorization.
Discret. Appl. Math., 2016

String Inference from the LCP Array.
CoRR, 2016

Lempel-Ziv Decoding in External Memory.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Analyzing Relative Lempel-Ziv Reference Construction.
Proceedings of the String Processing and Information Retrieval, 2016

RLZAP: Relative Lempel-Ziv with Adaptive Pointers.
Proceedings of the String Processing and Information Retrieval, 2016

Longest Common Abelian Factors and Large Alphabets.
Proceedings of the String Processing and Information Retrieval, 2016

Range Predecessor and Lempel-Ziv Parsing.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Scalable Partial Least Squares Regression on Grammar-Compressed Data Matrices.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Faster, Minuter.
Proceedings of the 2016 Data Compression Conference, 2016

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Approximate pattern matching in LZ77-compressed texts.
J. Discrete Algorithms, 2015

Relative Compressed Suffix Trees.
CoRR, 2015

Diverse Palindromic Factorization is NP-Complete.
CoRR, 2015

Misassembly detection using paired-end sequence reads and optical mapping data.
Bioinform., 2015

Access, Rank, and Select in Grammar-compressed Strings.
Proceedings of the Algorithms - ESA 2015, 2015

Diverse Palindromic Factorization Is NP-complete.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Document Counting in Compressed Space.
Proceedings of the 2015 Data Compression Conference, 2015

Variable-Order de Bruijn Graphs.
Proceedings of the 2015 Data Compression Conference, 2015

Queries on LZ-Bounded Encodings.
Proceedings of the 2015 Data Compression Conference, 2015

Parallel External Memory Suffix Sorting.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Fast and efficient compression of high-throughput sequencing reads.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
Order-preserving matching.
Theor. Comput. Sci., 2014

General Document Retrieval in Compact Space.
ACM J. Exp. Algorithmics, 2014

Searching and Indexing Genomic Databases via Kernelization.
CoRR, 2014

Document Counting in Practice.
CoRR, 2014

Rank, select and access in grammar-compressed strings.
CoRR, 2014

Efficient Indexed Alignment of Contigs to Optical Maps.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Relative Lempel-Ziv with Constant-Time Random Access.
Proceedings of the String Processing and Information Retrieval, 2014

LZ77-Based Self-indexing with Faster Pattern Matching.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Document Retrieval on Repetitive Collections.
Proceedings of the Algorithms - ESA 2014, 2014

Hybrid Compression of Bitvectors for the FM-Index.
Proceedings of the Data Compression Conference, 2014

Lempel-Ziv Parsing in External Memory.
Proceedings of the Data Compression Conference, 2014

Relative Lempel-Ziv with Constant-Time Random Access.
Proceedings of the Data Compression Conference, 2014

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

2013
Colored range queries and document retrieval.
Theor. Comput. Sci., 2013

Enhanced string covering.
Theor. Comput. Sci., 2013

AliBI: An Alignment-Based Index for Genomic Datasets.
CoRR, 2013

Hybrid Indexes for Repetitive Datasets.
CoRR, 2013

Lightweight Lempel-Ziv Parsing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Crochemore's String Matching Algorithm: Simplification, Extensions, Applications.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Linear Time Lempel-Ziv Factorization: Simple, Fast, Small.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Document Listing on Repetitive Collections.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Lempel-Ziv factorization: Simple, fast, practical.
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012
Practical Efficient String Mining.
IEEE Trans. Knowl. Data Eng., 2012

New algorithms on wavelet trees and applications to information retrieval.
Theor. Comput. Sci., 2012

Revisiting bounded context block-sorting transformations.
Softw. Pract. Exp., 2012

Editorial.
J. Discrete Algorithms, 2012

Distributed String Mining for High-Throughput Sequencing Data.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

New and Efficient Approaches to the Quasiperiodic Characterisation of a String.
Proceedings of the Prague Stringology Conference 2012, 2012

A Faster Grammar-Based Self-index.
Proceedings of the Language and Automata Theory and Applications, 2012

Slashing the Time for BWT Inversion.
Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

Trends in Su x Sorting: A Survey of Low Memory Algorithms.
Proceedings of the Thirty-Fifth Australasian Computer Science Conference, 2012

2011
Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections.
Proc. VLDB Endow., 2011

A Compressed Self-Index for Genomic Databases
CoRR, 2011

Practical Compressed Document Retrieval.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Reference Sequence Construction for Relative Compression of Genomes.
Proceedings of the String Processing and Information Retrieval, 2011

Fixed Block Compression Boosting in FM-Indexes.
Proceedings of the String Processing and Information Retrieval, 2011

Sample selection for dictionary-based corpus compression.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Faster Approximate Pattern Matching in Compressed Repetitive Texts.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Backwards Search in Context Bound Text Transformations.
Proceedings of the First International Conference on Data Compression, 2011

Cache Friendly Burrows-Wheeler Inversion.
Proceedings of the First International Conference on Data Compression, 2011

Optimized Relative Lempel-Ziv Compression of Genomes.
Proceedings of the Thirty-Fourth Australasian Computer Science Conference, 2011

2010
Fast, Practical Algorithms for Computing All the Repeats in a String.
Math. Comput. Sci., 2010

Dual-Sorted Inverted Lists.
Proceedings of the String Processing and Information Retrieval, 2010

Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval.
Proceedings of the String Processing and Information Retrieval, 2010

Colored Range Queries and Document Retrieval.
Proceedings of the String Processing and Information Retrieval, 2010

Medium-Space Algorithms for Inverse BWT.
Proceedings of the Algorithms, 2010

Top-<i>k</i> Ranked Document Search in General Text Databases.
Proceedings of the Algorithms, 2010

Presenting Query Aspects to Support Exploratory Search.
Proceedings of the User Interfaces 2010, 2010

2009
SHREC: a short-read error correction method.
Bioinform., 2009

A fast hybrid short read fragment assembly algorithm.
Bioinform., 2009

Range Quantile Queries: Another Virtue of Wavelet Trees.
Proceedings of the String Processing and Information Retrieval, 2009

Document Compaction for Efficient Query Biased Snippet Generation.
Proceedings of the Advances in Information Retrieval, 2009

Reducing Space Requirements for Disk Resident Suffix Arrays.
Proceedings of the Database Systems for Advanced Applications, 2009

Permuted Longest-Common-Prefix Array.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Testing Stream Ciphers by Finding the Longest Substring of a Given Density.
Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

2008
How many runs can a string contain?
Theor. Comput. Sci., 2008

Lempel-Ziv Factorization Using Less Time & Space.
Math. Comput. Sci., 2008

Words with Simple Burrows-Wheeler Transforms.
Electron. J. Comb., 2008

The expected number of runs in a word.
Australas. J Comb., 2008

RMIT University at TREC 2008: Relevance Feedback Track.
Proceedings of The Seventeenth Text REtrieval Conference, 2008

Fast Optimal Algorithms for Computing All the Repeats in a String.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Improving suffix array locality for fast pattern matching on disk.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Space-Time Tradeoffs for Longest-Common-Prefix Array Computation.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
An efficient, versatile approach to suffix sorting.
ACM J. Exp. Algorithmics, 2007

A taxonomy of suffix array construction algorithms.
ACM Comput. Surv., 2007

RMIT University at the TREC 2007 Enterprise Track.
Proceedings of The Sixteenth Text REtrieval Conference, 2007

Efficient token based clone detection with flexible tokenization.
Proceedings of the 6th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2007

Fast and Practical Algorithms for Computing All the Runs in a String.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
A New Periodicity Lemma.
SIAM J. Discret. Math., 2006

Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory.
Proceedings of the String Processing and Information Retrieval, 2006

Suffix arrays: what are they good for?
Proceedings of the Database Technologies 2006, 2006

2005
The Performance of Linear Time Suffix Sorting Algorithms.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005


  Loading...