| * | 2009 |
| 31 | EE | Sascha Steinbiss,
Gordon Gremme,
Christin Schärfer,
Malte Mader,
Stefan Kurtz:
AnnotationSketch: a genome annotation drawing library.
Bioinformatics 25(4): 533-534 (2009) |
| 2008 |
| 30 | EE | David Ellinghaus,
Stefan Kurtz,
Ute Willhoeft:
LTRharvest, an efficient and flexible software for de novo detection of LTR retrotransposons.
BMC Bioinformatics 9: (2008) |
| 29 | EE | Mohamed Ibrahim Abouelhoda,
Stefan Kurtz,
Enno Ohlebusch:
CoCoNUT: an efficient system for the comparison and analysis of genomes.
BMC Bioinformatics 9: (2008) |
| 28 | EE | Julia Herold,
Stefan Kurtz,
Robert Giegerich:
Efficient computation of absent words in genomic sequences.
BMC Bioinformatics 9: (2008) |
| 27 | EE | Enno Ohlebusch,
Stefan Kurtz:
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences.
Journal of Computational Biology 15(4): 357-377 (2008) |
| 2007 |
| 26 | EE | Stefan Gräf,
Fiona G. G. Nielsen,
Stefan Kurtz,
Martijn A. Huynen,
Ewan Birney,
Henk Stunnenberg,
Paul Flicek:
Optimized design and assessment of whole genome tiling arrays.
ISMB/ECCB (Supplement of Bioinformatics) 2007: 195-204 |
| 25 | EE | Fiona G. G. Nielsen,
Stefan Gräf,
Xinmin Zhang,
Stefan Kurtz,
Sergei Denissov,
Roland Green,
Ewan Birney,
Paul Flicek,
Martijn A. Huynen,
Henk Stunnenberg:
Optimising oligonucleotide array design for ChIP-on-chip.
BMC Bioinformatics 8(S-8): (2007) |
| 2005 |
| 24 | | Andrew E. Torda,
Stefan Kurtz,
Matthias Rarey:
Proceedings of the German Conference on Bioinformatics (GCB 2005), Hamburg, Germany, October 5-7, 2005
GI 2005 |
| 23 | EE | Gordon Gremme,
Volker Brendel,
Michael E. Sparks,
Stefan Kurtz:
Engineering a software tool for gene structure prediction in higher organisms.
Information & Software Technology 47(15): 965-978 (2005) |
| 2004 |
| 22 | | Michael Beckstette,
Dirk Strothmann,
Robert Homann,
Robert Giegerich,
Stefan Kurtz:
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays.
German Conference on Bioinformatics 2004: 53-64 |
| 21 | EE | Jomuna V. Choudhuri,
Chris Schleiermacher,
Stefan Kurtz,
Robert Giegerich:
GenAlyzer: interactive visualization of sequence similarities between entire genomes.
Bioinformatics 20(12): 1964-1965 (2004) |
| 20 | EE | Mohamed Ibrahim Abouelhoda,
Stefan Kurtz,
Enno Ohlebusch:
Replacing suffix trees with enhanced suffix arrays.
J. Discrete Algorithms 2(1): 53-86 (2004) |
| 19 | | Jan Krüger,
Alexander Sczyrba,
Stefan Kurtz,
Robert Giegerich:
e2g: an interactive web-based server for efficiently mapping large EST and cDNA sets to genomic sequences.
Nucleic Acids Research 32(Web-Server-Issue): 301-304 (2004) |
| 2003 |
| 18 | EE | Matthias Höchsmann,
Thomas Töller,
Robert Giegerich,
Stefan Kurtz:
Local Similarity in RNA Secondary Structures.
CSB 2003: 159-168 |
| 17 | | Patrick Chain,
Stefan Kurtz,
Enno Ohlebusch,
Tom Slezak:
An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges.
Briefings in Bioinformatics 4(2): 105-123 (2003) |
| 16 | | Alexander Sczyrba,
Jan Krüger,
Henning Mersch,
Stefan Kurtz,
Robert Giegerich:
RNA-related tools on the Bielefeld Bioinformatics Server.
Nucleic Acids Research 31(13): 3767-3770 (2003) |
| 15 | EE | Robert Giegerich,
Stefan Kurtz,
Jens Stoye:
Efficient implementation of lazy suffix trees.
Softw., Pract. Exper. 33(11): 1035-1049 (2003) |
| 2002 |
| 14 | | Michael Höhl,
Stefan Kurtz,
Enno Ohlebusch:
Efficient multiple genome alignment.
ISMB 2002: 312-320 |
| 13 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch,
Stefan Kurtz:
Optimal Exact Strring Matching Based on Suffix Arrays.
SPIRE 2002: 31-43 |
| 12 | EE | Mohamed Ibrahim Abouelhoda,
Stefan Kurtz,
Enno Ohlebusch:
The Enhanced Suffix Array and Its Applications to Genome Analysis.
WABI 2002: 449-463 |
| 2001 |
| 11 | | Stefan Gräf,
Dirk Strothmann,
Stefan Kurtz,
Gerhard Steger:
HyPaLib: a database of RNAs and RNA structural elements defined by hybrid patterns.
Nucleic Acids Research 29(1): 196-198 (2001) |
| 2000 |
| 10 | | Stefan Kurtz,
Enno Ohlebusch,
Chris Schleiermacher,
Jens Stoye,
Robert Giegerich:
Computation and Visualization of Degenerate Repeats in Complete Genomes.
ISMB 2000: 228-238 |
| 9 | EE | Bernhard Balkenhol,
Stefan Kurtz:
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice.
IEEE Trans. Computers 49(10): 1043-1053 (2000) |
| 1999 |
| 8 | EE | Robert Giegerich,
Stefan Kurtz,
Jens Stoye:
Efficient Implementation of Lazy Suffix Trees.
Algorithm Engineering 1999: 30-42 |
| 7 | EE | Bernhard Balkenhol,
Stefan Kurtz,
Yuri M. Shtarkov:
Modifications of the Burrows and Wheeler Data Compression Algorithm.
Data Compression Conference 1999: 188-197 |
| 6 | | Stefan Kurtz,
Chris Schleiermacher:
REPuter: fast computation of maximal repeats in complete genomes.
Bioinformatics 15(5): 426-427 (1999) |
| 5 | | Stefan Kurtz:
Reducing the space requirement of suffix trees.
Softw., Pract. Exper. 29(13): 1149-1171 (1999) |
| 1997 |
| 4 | | Stefan Kurtz,
Gene Myers:
Estimating the Probability of Approximate Matches.
CPM 1997: 52-64 |
| 3 | | Robert Giegerich,
Stefan Kurtz:
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction.
Algorithmica 19(3): 331-353 (1997) |
| 1995 |
| 2 | | Robert Giegerich,
Stefan Kurtz:
A Comparison of Imperative and Purely Functional Suffix Tree Constructions.
Sci. Comput. Program. 25(2-3): 187-218 (1995) |
| 1994 |
| 1 | EE | Robert Giegerich,
Stefan Kurtz:
Suffix Trees in the Functional Programming Paradigm.
ESOP 1994: 225-240 |