default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Kurtz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j34]Fabian Hausmann
, Stefan Kurtz:
DeepGRP: engineering a software tool for predicting genomic repetitive elements using Recurrent Neural Networks with attention. Algorithms Mol. Biol. 16(1): 20 (2021)
2010 – 2019
- 2019
- [j33]Giorgio Gonnella, Niklas Niehus, Stefan Kurtz:
GfaViz: flexible and interactive visualization of GFA sequence graphs. Bioinform. 35(16): 2853-2855 (2019) - 2017
- [j32]Giorgio Gonnella, Stefan Kurtz:
GfaPy: a flexible and extensible software library for handling sequence graphs in Python. Bioinform. 33(19): 3094-3095 (2017) - 2014
- [j31]Malte Mader, Ronald Simon, Stefan Kurtz:
FISH Oracle 2: a web server for integrative visualization of genomic data in cancer research. J. Clin. Bioinform. 4: 5 (2014) - 2013
- [j30]Fernando Meyer, Stefan Kurtz, Michael Beckstette:
Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns. BMC Bioinform. 14: 226 (2013) - [j29]Gordon Gremme, Sascha Steinbiss, Stefan Kurtz:
GenomeTools: A Comprehensive Software Library for Efficient Processing of Structured Genome Annotations. IEEE ACM Trans. Comput. Biol. Bioinform. 10(3): 645-656 (2013) - 2012
- [j28]Giorgio Gonnella, Stefan Kurtz:
Readjoiner: a fast and memory efficient string graph-based sequence assembler. BMC Bioinform. 13: 82 (2012) - [j27]Sascha Steinbiss, Stefan Kurtz:
A New Efficient Data Structure for Storage and Retrieval of Multiple Biosequences. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 345-357 (2012) - 2011
- [j26]Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebastian Will, Michael Beckstette:
Structator: fast index-based search for RNA sequence-structure patterns. BMC Bioinform. 12: 214 (2011) - [j25]Malte Mader, Ronald Simon, Sascha Steinbiss, Stefan Kurtz:
FISH Oracle: a web server for flexible visualization of DNA copy number data in a genomic context. J. Clin. Bioinform. 1: 20 (2011) - [j24]Malik Alawi, Stefan Kurtz, Michael Beckstette:
CASSys: an integrated software-system for the interactive analysis of ChIP-seq data. J. Integr. Bioinform. 8(2) (2011)
2000 – 2009
- 2009
- [j23]Sascha Steinbiss, Gordon Gremme, Christin Schärfer, Malte Mader, Stefan Kurtz:
AnnotationSketch: a genome annotation drawing library. Bioinform. 25(4): 533-534 (2009) - [j22]Michael Beckstette, Robert Homann, Robert Giegerich, Stefan Kurtz:
Significant speedup of database searches with HMMs by search space reduction with PSSM family models. Bioinform. 25(24): 3251-3258 (2009) - [j21]Steve Hoffmann, Christian Otto, Stefan Kurtz, Cynthia M. Sharma, Philipp Khaitovich, Jörg Vogel, Peter F. Stadler, Jörg Hackermüller:
Fast Mapping of Short Sequences with Mismatches, Insertions and Deletions Using Index Structures. PLoS Comput. Biol. 5(9) (2009) - 2008
- [j20]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinform. 9 (2008) - [j19]David Ellinghaus, Stefan Kurtz, Ute Willhoeft:
LTRharvest, an efficient and flexible software for de novo detection of LTR retrotransposons. BMC Bioinform. 9 (2008) - [j18]Julia Herold, Stefan Kurtz, Robert Giegerich:
Efficient computation of absent words in genomic sequences. BMC Bioinform. 9 (2008) - [j17]Enno Ohlebusch, Stefan Kurtz:
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences. J. Comput. Biol. 15(4): 357-377 (2008) - 2007
- [j16]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 Bioinform. 8(S-8) (2007) - [c11]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 - 2006
- [j15]Michael Beckstette, Robert Homann, Robert Giegerich, Stefan Kurtz:
Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinform. 7: 389 (2006) - 2005
- [j14]Gordon Gremme, Volker Brendel, Michael E. Sparks, Stefan Kurtz:
Engineering a software tool for gene structure prediction in higher organisms. Inf. Softw. Technol. 47(15): 965-978 (2005) - [e1]Andrew E. Torda, Stefan Kurtz, Matthias Rarey:
Proceedings of the German Conference on Bioinformatics (GCB 2005), Hamburg, Germany, October 5-7, 2005. LNI P-71, GI 2005, ISBN 3-88579-400-4 [contents] - 2004
- [j13]Jomuna V. Choudhuri, Chris Schleiermacher, Stefan Kurtz, Robert Giegerich:
GenAlyzer: interactive visualization of sequence similarities between entire genomes. Bioinform. 20(12): 1964-1965 (2004) - [j12]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1): 53-86 (2004) - [j11]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 Res. 32(Web-Server-Issue): 301-304 (2004) - [c10]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 - [r1]Stefan Kurtz, Stefano Lonardi:
Computational Biology. Handbook of Data Structures and Applications 2004 - 2003
- [j10]Patrick S. G. Chain, Stefan Kurtz, Enno Ohlebusch, Tom Slezak:
An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges. Briefings Bioinform. 4(2): 105-123 (2003) - [j9]Alexander Sczyrba, Jan Krüger, Henning Mersch, Stefan Kurtz, Robert Giegerich:
RNA-related tools on the Bielefeld Bioinformatics Server. Nucleic Acids Res. 31(13): 3767-3770 (2003) - [j8]Robert Giegerich, Stefan Kurtz, Jens Stoye:
Efficient implementation of lazy suffix trees. Softw. Pract. Exp. 33(11): 1035-1049 (2003) - [c9]Matthias Höchsmann, Thomas Töller, Robert Giegerich, Stefan Kurtz:
Local Similarity in RNA Secondary Structures. CSB 2003: 159-168 - 2002
- [j7]J. Patrick Fitch, Shea N. Gardner, Thomas A. Kuczmarski, Stefan Kurtz, Rich Myers, Linda L. Ott, Thomas R. Slezak, Elizabeth A. Vitalis, Adam T. Zemla, Paula M. McCready:
Rapid development of nucleic acid diagnostics. Proc. IEEE 90(11): 1708-1721 (2002) - [c8]Michael Höhl, Stefan Kurtz, Enno Ohlebusch:
Efficient multiple genome alignment. ISMB 2002: 312-320 - [c7]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz:
Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE 2002: 31-43 - [c6]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI 2002: 449-463 - 2001
- [j6]Stefan Gräf, Dirk Strothmann, Stefan Kurtz, Gerhard Steger:
HyPaLib: a database of RNAs and RNA structural elements defined by hybrid patterns. Nucleic Acids Res. 29(1): 196-198 (2001) - 2000
- [j5]Bernhard Balkenhol, Stefan Kurtz:
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice. IEEE Trans. Computers 49(10): 1043-1053 (2000) - [c5]Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich:
Computation and Visualization of Degenerate Repeats in Complete Genomes. ISMB 2000: 228-238
1990 – 1999
- 1999
- [j4]Stefan Kurtz, Chris Schleiermacher:
REPuter: fast computation of maximal repeats in complete genomes. Bioinform. 15(5): 426-427 (1999) - [j3]Stefan Kurtz:
Reducing the space requirement of suffix trees. Softw. Pract. Exp. 29(13): 1149-1171 (1999) - [c4]Bernhard Balkenhol, Stefan Kurtz, Yuri M. Shtarkov:
Modifications of the Burrows and Wheeler Data Compression Algorithm. Data Compression Conference 1999: 188-197 - [c3]Robert Giegerich, Stefan Kurtz, Jens Stoye:
Efficient Implementation of Lazy Suffix Trees. WAE 1999: 30-42 - 1997
- [j2]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) - [c2]Stefan Kurtz, Gene Myers:
Estimating the Probability of Approximate Matches. CPM 1997: 52-64 - 1995
- [b1]Stefan Kurtz:
Fundamental algorithms for a declarative pattern matching system. Bielefeld University, Germany, 1995, pp. 1-237 - [j1]Robert Giegerich, Stefan Kurtz:
A Comparison of Imperative and Purely Functional Suffix Tree Constructions. Sci. Comput. Program. 25(2-3): 187-218 (1995) - 1994
- [c1]Robert Giegerich, Stefan Kurtz:
Suffix Trees in the Functional Programming Paradigm. ESOP 1994: 225-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
