Enno Ohlebusch

2024

doi dblp
Faster Computation of Chinese Frequent Strings and Their Net Frequencies.
Enno Ohlebusch|Thomas Büchler|Jannik Olbrich
String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings

2022

doi dblp
On the Optimisation of the GSACA Suffix Array Construction Algorithm.
Jannik Olbrich|Enno Ohlebusch|Thomas Büchler
String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings

2019

doi dblp
On the Computation of Longest Previous Non-overlapping Factors.
Enno Ohlebusch|Pascal Weber
String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings

2018

doi dblp
Trickier XBWT Tricks.
Enno Ohlebusch|Stefan Stauß|Uwe Baier
String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings

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

2010

doi dblp
CST++.
Enno Ohlebusch|Johannes Fischer|Simon Gog
String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings
doi dblp
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes.
Enno Ohlebusch|Simon Gog|Adrian Kügel
String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings

2009

doi dblp
A Compressed Enhanced Suffix Array Supporting Fast String Matching.
Enno Ohlebusch|Simon Gog
String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, Saariselkä, Finland, August 25-27, 2009, Proceedings

2002

doi dblp
Optimal Exact Strring Matching Based on Suffix Arrays.
Mohamed Ibrahim Abouelhoda|Enno Ohlebusch|Stefan Kurtz
String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings