Stefan Kurtz
Stefan Kurtz
Professor of Computer Science, University of Hamburg
Bestätigte E-Mail-Adresse bei
TitelZitiert vonJahr
Versatile and open software for comparing large genomes
S Kurtz, A Phillippy, AL Delcher, M Smoot, M Shumway, C Antonescu, ...
Genome biology 5 (2), R12, 2004
REPuter: the manifold applications of repeat analysis on a genomic scale
S Kurtz, JV Choudhuri, E Ohlebusch, C Schleiermacher, J Stoye, ...
Nucleic acids research 29 (22), 4633-4642, 2001
Replacing suffix trees with enhanced suffix arrays
MI Abouelhoda, S Kurtz, E Ohlebusch
Journal of discrete algorithms 2 (1), 53-86, 2004
Reducing the space requirement of suffix trees
S Kurtz
Software: Practice and Experience 29 (13), 1149-1171, 1999
REPuter: fast computation of maximal repeats in complete genomes.
S Kurtz, C Schleiermacher
Bioinformatics (Oxford, England) 15 (5), 426-427, 1999
Fast mapping of short sequences with mismatches, insertions and deletions using index structures
S Hoffmann, C Otto, S Kurtz, CM Sharma, P Khaitovich, J Vogel, ...
PLoS computational biology 5 (9), e1000502, 2009
LTRharvest, an efficient and flexible software for de novo detection of LTR retrotransposons
D Ellinghaus, S Kurtz, U Willhoeft
BMC bioinformatics 9 (1), 18, 2008
Local similarity in RNA secondary structures
M Hochsmann, T Toller, R Giegerich, S Kurtz
Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE …, 2003
From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
R Giegerich, S Kurtz
Algorithmica 19 (3), 331-353, 1997
Genomic Deletion of PTEN Is Associated with Tumor Progression and Early PSA Recurrence in ERG Fusion-Positive and Fusion-Negative Prostate Cancer
A Krohn, T Diedler, L Burkhardt, PS Mayer, C De Silva, ...
The American journal of pathology 181 (2), 401-412, 2012
Efficient multiple genome alignment
M Höhl, S Kurtz, E Ohlebusch
Bioinformatics 18 (suppl_1), S312-S320, 2002
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 2004
A new method to compute K-mer frequencies and its application to annotate large repetitive plant genomes
S Kurtz, A Narechania, JC Stein, D Ware
BMC genomics 9 (1), 517, 2008
The enhanced suffix array and its applications to genome analysis
MI Abouelhoda, S Kurtz, E Ohlebusch
International Workshop on Algorithms in Bioinformatics, 449-463, 2002
Fast index based algorithms and software for matching position specific scoring matrices
M Beckstette, R Homann, R Giegerich, S Kurtz
BMC bioinformatics 7 (1), 389, 2006
Engineering a software tool for gene structure prediction in higher organisms
G Gremme, V Brendel, ME Sparks, S Kurtz
Information and Software Technology 47 (15), 965-978, 2005
Efficient implementation of lazy suffix trees
R Giegerich, S Kurtz, J Stoye
Software: Practice and Experience 33 (11), 1035-1049, 2003
Optimal exact string matching based on suffix arrays
MI Abouelhoda, E Ohlebusch, S Kurtz
International Symposium on String Processing and Information Retrieval, 31-43, 2002
Recurrent deletion of 3p13 targets multiple tumour suppressor genes and defines a distinct subgroup of aggressive ERG fusion‐positive prostate cancers
A Krohn, A Seidel, L Burkhardt, F Bachmann, M Mader, K Grupp, ...
The Journal of pathology 231 (1), 130-141, 2013
GenomeTools: a comprehensive software library for efficient processing of structured genome annotations
G Gremme, S Steinbiss, S Kurtz
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 10 …, 2013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20