Timo Beller

Publication Activity (10 Years)

Years Active: 2011-2017
Publications (10 Years): 9

Top Venues

SPIRE

J. Discrete Algorithms

CoRR

CPM

University of Ulm, Germany (PHD)

Education History

University of Ulm, Germany

PHD

Publications

Uwe Baier, Timo Beller, Enno Ohlebusch
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies. ACM J. Exp. Algorithmics 22 (2017)
Markus Mauer, Timo Beller, Enno Ohlebusch
A Lempel-Ziv-style Compression Method for Repetitive Texts. Stringology (2017)
Timo Beller, Enno Ohlebusch
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Algorithms Mol. Biol. 11 (2016)
Timo Beller, Enno Ohlebusch
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. CoRR (2016)
Uwe Baier, Timo Beller, Enno Ohlebusch
Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform. Bioinform. 32 (4) (2016)
Timo Beller, Enno Ohlebusch
Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Algorithms Mol. Biol. 11 (2016)
Timo Beller, Enno Ohlebusch
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. CPM (2015)
Uwe Baier, Timo Beller, Enno Ohlebusch
Parallel Construction of Succinct Representations of Suffix Tree Topologies. SPIRE (2015)
Enno Ohlebusch, Timo Beller
Alphabet-independent algorithms for finding context-sensitive repeats in linear time. J. Discrete Algorithms 34 (2015)
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
Computing the Burrows-Wheeler transform of a string and its reverse in parallel. J. Discrete Algorithms 25 (2014)
Enno Ohlebusch, Timo Beller
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time. SPIRE (2014)
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
From Theory to Practice: Plug and Play with Succinct Data Structures. SEA (2014)
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
From Theory to Practice: Plug and Play with Succinct Data Structures. CoRR (2013)
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18 (2013)
Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch
Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE (2013)
Timo Beller, Katharina Berger, Enno Ohlebusch
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. SPIRE (2012)
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
Computing the Burrows-Wheeler Transform of a String and Its Reverse. CPM (2012)
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE (2011)

Timo Beller.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Timo Beller