Timo Beller

According to our database, Timo Beller authored at least 15 papers between 2012 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2017

Space-efficient construction and applications of basic data structures in full text indexing.

Timo Beller

PhD thesis, 2017

Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies.

Uwe Baier, Timo Beller, Enno Ohlebusch

ACM J. Exp. Algorithmics, 2017

A Lempel-Ziv-style Compression Method for Repetitive Texts.

Markus Mauer, Timo Beller, Enno Ohlebusch

Proceedings of the Prague Stringology Conference 2017, 2017

2016

Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.

Uwe Baier, Timo Beller, Enno Ohlebusch

Bioinform., 2016

Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.

Timo Beller, Enno Ohlebusch

Algorithms Mol. Biol., 2016

A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.

Timo Beller, Enno Ohlebusch

Algorithms Mol. Biol., 2016

2015

Alphabet-independent algorithms for finding context-sensitive repeats in linear time.

Enno Ohlebusch, Timo Beller

J. Discrete Algorithms, 2015

Parallel Construction of Succinct Representations of Suffix Tree Topologies.

Uwe Baier, Timo Beller, Enno Ohlebusch

Proceedings of the String Processing and Information Retrieval, 2015

Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis.

Timo Beller, Enno Ohlebusch

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

2014

Computing the Burrows-Wheeler transform of a string and its reverse in parallel.

Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda

J. Discrete Algorithms, 2014

From Theory to Practice: Plug and Play with Succinct Data Structures.

Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013

Computing the longest common prefix array based on the Burrows-Wheeler transform.

Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger

J. Discrete Algorithms, 2013

Space-Efficient Construction of the Burrows-Wheeler Transform.

Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch

Proceedings of the String Processing and Information Retrieval, 2013

2012

Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences.

Timo Beller, Katharina Berger, Enno Ohlebusch

Proceedings of the String Processing and Information Retrieval, 2012

Computing the Burrows-Wheeler Transform of a String and Its Reverse.

Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012