Fabio Cunial

Olgert Denas

Bioinform., 2022

2020

Linear-time String Indexing and Analysis in Small Space.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Smaller Fully-Functional Bidirectional BWT Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

2019

Fully-functional bidirectional Burrows-Wheeler indexes.

[BibT_eX]

[DOI]

CoRR, 2019

A framework for space-efficient variable-order Markov models.

[BibT_eX]

[DOI]

Jarno Alanko

Bioinform., 2019

Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs.

[BibT_eX]

[DOI]

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

2018

Fast matching statistics in small space.

[BibT_eX]

[DOI]

Olgert Denas

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017

A framework for space-efficient read clustering in metagenomic samples.

[BibT_eX]

[DOI]

BMC Bioinform., 2017

A Framework for Space-Efficient String Kernels.

[BibT_eX]

[DOI]

Algorithmica, 2017

Fast Label Extraction in the CDAWG.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

Representing the Suffix Tree with the CDAWG.

[BibT_eX]

[DOI]

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

Flexible Indexing of Repetitive Collections.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Suffix Trees and Arrays.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Practical combinations of repetition-aware data structures.

[BibT_eX]

[DOI]

CoRR, 2016

2015

LAF: Logic Alignment Free and its application to bacterial genomes classification.

[BibT_eX]

[DOI]

Emanuel Weitschek

Giovanni Felici

BioData Min., 2015

Space-Efficient Detection of Unusual Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Composite Repetition-Aware Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9781107078536, 2015

2014

Indexed Matching Statistics and Shortest Unique Substrings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2014

Classifying Bacterial Genomes with Compact Logic Formulas on k-Mer Frequencies.

[BibT_eX]

[DOI]

Emanuel Weitschek

Giovanni Felici

Proceedings of the 25th International Workshop on Database and Expert Systems Applications, 2014

2013

Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Analysis of the subsequence composition of biosequences.

[BibT_eX]

[DOI]

PhD thesis, 2012

Phylogeny Construction with Rigid Gapped Motifs.

[BibT_eX]

[DOI]

J. Comput. Biol., 2012

Faster Variance Computation for Patterns with Gaps.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

2011

Sequence Similarity by Gapped LZW.

[BibT_eX]

[DOI]

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

2010

The Subsequence Composition of Polypeptides.

[BibT_eX]

[DOI]

J. Comput. Biol., 2010

2009

The subsequence composition of a string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Probing the Randomness of Proteins by Their Subsequence Composition.

[BibT_eX]

[DOI]

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

2008

Table Compression by Record Intersections.

[BibT_eX]

[DOI]