Timo Beller

19 papers B 3C 5Misc 1Journal 9
YearRankTypeTitle / Venue / Authors
2017 Misc conf
A Lempel-Ziv-style Compression Method for Repetitive Texts.
PSC
Markus Mauer, Timo Beller, Enno Ohlebusch
2017 J jnl
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies.
ACM J. Exp. Algorithmics
Uwe Baier, Timo Beller, Enno Ohlebusch
2017 — —
Space-efficient construction and applications of basic data structures in full text indexing.
Timo Beller
2016 J jnl
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.
Algorithms Mol. Biol.
Timo Beller, Enno Ohlebusch
2016 J jnl
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.
CoRR
Timo Beller, Enno Ohlebusch
2016 J jnl
Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.
Algorithms Mol. Biol.
Timo Beller, Enno Ohlebusch
2016 J jnl
Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.
Bioinform.
Uwe Baier, Timo Beller, Enno Ohlebusch
2015 J jnl
Alphabet-independent algorithms for finding context-sensitive repeats in linear time.
J. Discrete Algorithms
Enno Ohlebusch, Timo Beller
2015 B conf
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis.
CPM
Timo Beller, Enno Ohlebusch
2015 C conf
Parallel Construction of Succinct Representations of Suffix Tree Topologies.
SPIRE
Uwe Baier, Timo Beller, Enno Ohlebusch
2014 C conf
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time.
SPIRE
Enno Ohlebusch, Timo Beller
2014 J jnl
Computing the Burrows-Wheeler transform of a string and its reverse in parallel.
J. Discrete Algorithms
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
2014 B conf
From Theory to Practice: Plug and Play with Succinct Data Structures.
SEA
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
2013 J jnl
Computing the longest common prefix array based on the Burrows-Wheeler transform.
J. Discrete Algorithms
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
2013 J jnl
From Theory to Practice: Plug and Play with Succinct Data Structures.
CoRR
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
2013 C conf
Space-Efficient Construction of the Burrows-Wheeler Transform.
SPIRE
Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch
2012 B conf
Computing the Burrows-Wheeler Transform of a String and Its Reverse.
CPM
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
2012 C conf
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences.
SPIRE
Timo Beller, Katharina Berger, Enno Ohlebusch
2011 C conf
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform.
SPIRE
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger