2015

doi dblp
Parallel Construction of Succinct Representations of Suffix Tree Topologies
Uwe Baier | Timo Beller | Enno Ohlebusch
String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings

2014

doi dblp
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time
Enno Ohlebusch | Timo Beller
String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings

2013

doi dblp
Space-Efficient Construction of the Burrows-Wheeler Transform
Timo Beller | Maike Zwerger | Simon Gog | Enno Ohlebusch
String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings

2012

doi dblp
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences
Timo Beller | Katharina Berger | Enno Ohlebusch
String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings

2011

doi dblp
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform
Timo Beller | Simon Gog | Enno Ohlebusch | Thomas Schnattinger
String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings

Search