Jouni Sirén

Orcid: 0000-0001-5828-4139

According to our database1, Jouni Sirén authored at least 31 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Wheeler Maps.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2022
GBZ file format for pangenome graphs.
Bioinform., November, 2022

Computational graph pangenomics: a tutorial on data structures and their applications.
Nat. Comput., 2022

2021
Efficiently Merging r-indexes.
Proceedings of the 31st Data Compression Conference, 2021

2020
Haplotype-aware graph indexes.
Bioinform., 2020

Distance indexing and seed clustering in sequence graphs.
Bioinform., 2020

2018
Relative Suffix Trees.
Comput. J., 2018

2017
Wheeler graphs: A framework for BWT-based data structures.
Theor. Comput. Sci., 2017

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

Indexing Variation Graphs.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

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

Burrows-Wheeler Transform for Terabases.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Fast in-memory XPath search using compressed indexes.
Softw. Pract. Exp., 2015

Relative Compressed Suffix Trees.
CoRR, 2015

Relative Select.
Proceedings of the String Processing and Information Retrieval, 2015

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

2014
Indexing Graphs for Path Queries with Applications in Genome Research.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Reusing an FM-index.
CoRR, 2014

Document Counting in Practice.
CoRR, 2014

Relative FM-Indexes.
Proceedings of the String Processing and Information Retrieval, 2014

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

2013
Distribution-Aware Compressed Full-Text Indexes.
Algorithmica, 2013

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

2012
Compressed Full-Text Indexes for Highly Repetitive Collections.
PhD thesis, 2012

2011
Indexing Finite Language Representation of Population Genotypes.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

2010
Storage and Retrieval of Highly Repetitive Sequence Collections.
J. Comput. Biol., 2010

Sampled Longest Common Prefix Array.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Fast In-Memory XPath Search over Compressed Text and Tree Indexes
CoRR, 2009

Compressed Suffix Arrays for Massive Data.
Proceedings of the String Processing and Information Retrieval, 2009

Storage and Retrieval of Individual Genomes.
Proceedings of the Research in Computational Molecular Biology, 2009

2008
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.
Proceedings of the String Processing and Information Retrieval, 2008


  Loading...