Universität Hamburg
Zentrum für Bioinformatik
Zentrum für Bioinformatik
Universität Hamburg
  UHH > Zentrum für Bioinformatik > Mitarbeiter
Druckversion dieser Seite 
  


Home
Mitarbeiter
Studium MSc Bioinformatik
Studium BSc Computing in Science
Informationen für Schülerinnen und Schüler
Nebenfach Bioinformatik
Lehre
Lehreevaluation
Vorträge
Forschung
Stellenausschreibungen
Dokumente
Server
Publikationen
Alumni
BibTeX file

pdf version of this page


     
  1. A Comparison of Imperative and Purely Functional Suffix Tree Constructions, R. Giegerich and S. Kurtz. Science of Computer Programming, 25(2-3):187-218, 1995.

    2.  
  2. Approximate String Searching under Weighted Edit Distance, S. Kurtz. In Proceedings of Third South American Workshop on String Processing, Recife, Brazil, pages 156-170. Carlton University Press, 1996.

    3.  
  3. Estimating the Probability of Approximate Matches, S. Kurtz and G. Myers. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM'97), Lecture Notes in Computer Science 1075, pages 52-64. Springer Verlag, 1997.

    4.  
  4. From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction, R. Giegerich and S. Kurtz. Algorithmica, 19:331-353, 1997.

    5.  
  5. A General Technique to Improve Filter Algorithms for Approximate String Matching, R. Giegerich, F. Hischke, S. Kurtz, and E. Ohlebusch. In Proceedings of Fourth South American Workshop on String Processing, Valparaiso, Chile, pages 38-52. Carlton University Press, 1997.

    6.  
  6. REPuter: Fast Computation of Maximal Repeats in Complete Genomes, S. Kurtz and C. Schleiermacher. Bioinformatics, 15(5):426-427, 1999.

    7.  
  7. Reducing the Space Requirement of Suffix Trees, S. Kurtz. Software-Practice and Experience, 29(13):1149-1171, 1999.

    8.  
  8. An Algebraic Dynamic Programming Approach to the Analysis of Recombinant DNA Sequences, R. Giegerich, S. Kurtz, and G.F. Weiller. In Proceedings of Workshop on Algorithmic Ascpects of Advanced Programming Languages (WAAAPL), Paris, September 1999, pages 77-88, 1999. Proceedings appear as Technical Report CUCS-023-99, Department of Computer Science, Columbia University, Editor: Chris Okasaki.

    9.  
  9. Straight to the Heart of Computer Science via Functional Programming, R. Giegerich, R. Hinze, and S. Kurtz. In Proceedings of the Workshop on Functional and Declarative Programming in Education, pages 1-5. Technical Report Rice COMP TR99-346, Department of Computer Science, Rice University, Editor: Matthias Felleisen, 1999.

    10.  
  10. Efficient Implementation of Lazy Suffix Trees, R. Giegerich, S. Kurtz, and J. Stoye. In Proceedings of the Third Workshop on Algorithmic Engineering (WAE99), pages 30-42. Lecture Notes in Computer Science 1668, 1999.

    11.  
  11. Modification of the Burrows and Wheeler Data Compression Algorithm, B. Balkenhol, S. Kurtz, and Y.M. Shtarkov. In Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pages 188-197. IEEE Computer Society Press, 1999.

    12.  
  12. Space Efficient Linear Time Computation of the Burrows and Wheeler Transformation, S. Kurtz and B. Balkenhol. In I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M.S. Pinsker, A. Sarközy, I. Wegener, and Z. Zhang, editors, Numbers, Information and Complexity, pages 375-383. Kluwer Academic Publishers, 2000.

    13.  
  13. Universal Data Compression Based on the Burrows and Wheeler Transformation: Theory and Practice, B. Balkenhol and S. Kurtz. IEEE Trans. on Computers, 49(1):1043-1053, 2000.

    14.  
  14. Computation and Visualization of Degenerate Repeats in Complete Genomes, S. Kurtz, E. Ohlebusch, C. Schleiermacher, J. Stoye, and R. Giegerich. In Proceedings of the International Conference on Intelligent Systems for Molecular Biology, pages 228-238, Menlo Park, CA, 2000.

    15.  
  15. HyPaLib: a Database of RNAs and RNA Structural Elements defined by Hybrid Patterns, S. Gräf, D. Strothmann, S. Kurtz, and G. Steger. Nucleic Acids Res., 29(1):196-198, 2001.

    16.  
  16. REPuter: The Manifold Applications of Repeat Analysis on a Genomic Scale, S. Kurtz, J.V. Choudhuri, E. Ohlebusch, C. Schleiermacher, J. Stoye, and R. Giegerich. Nucleic Acids Res., 29(22):4633-4642, 2001.

    17.  
  17. Parallel Suffix Sorting, N. Futamura, S. Aluru, and S. Kurtz. In Iyengarm S.S. and B.P. Sinha, editors, Proceedings of the Ninth International Conference on Advanced Computing and Communications, Bhubaneshwar, India, pages 76-81, New-Dehli, India, 2001.

    18.  
  18. Comparative Genomics of Arabidopsis and Maize: Prospects and Limitations, V. Brendel, S. Kurtz, and V. Walbot. Genome Biology, 3(3):reviews1005.1-1005.6, 2002.

    19.  
  19. Efficient Multiple Genome Alignment, M. Höhl, S. Kurtz, and E. Ohlebusch. Bioinformatics, 18(Suppl. 1):S312-S320, 2002.

    20.  
  20. The Enhanced Suffix Array and its Applications to Genome Analysis, M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch. In Proceedings of the Second Workshop on Algorithms in Bioinformatics, pages 449-463. Lecture Notes in Computer Science 2452, Springer-Verlag, 2002.

    21.  
  21. Optimal Exact String Matching Based on Suffix Arrays, M.I. Abouelhoda, E. Ohlebusch, and S. Kurtz. In Proceedings of the Ninth International Symposium on String Processing and Information Retrieval, pages 31-43. Lecture Notes in Computer Science 2476, Springer-Verlag, 2002.

    22.  
  22. Rapid Development of Nucleic Acid Diagnostics, J.P. Fitch, S.N. Gardner, T.A. Kuczmarski, S. Kurtz, R. Myers, L.L. Ott, T.R. Slezak, E.A. Vitalis, A.T. Zemla, and P.M. McCready. Proceedings of the IEEE, 90(11):1708-1721, 2002.

    23.  
  23. An Applications-Focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges, P. Chain, S. Kurtz, E. Ohlebusch, and T.R. Slezak. Briefings in Bioinformatics, 4(2):105-123, 2003.

    24.  
  24. RNA-related tools on the Bielefeld Bioinformatics Server, A. Sczyrba, J. Krüger, H. Mersch, S. Kurtz, and R. Giegerich. Nucleic Acids Res., 31(13):3767-3770, 2003.

    25.  
  25. Local Similarity in RNA Secondary Structures, M. Höchsmann, T. Töller, R. Giegerich, and S. Kurtz. In Proc of the Computational Systems Bioinformatics Conference, Stanford, CA, August 2003 (CSB 2003), 2003.

    26.  
  26. Efficient Implementation of Lazy Suffix Trees, R. Giegerich, S. Kurtz, and J. Stoye. Software-Practice and Experience, 33(11):1035-1049, 2003.

    27.  
  27. Replacing Suffix Trees with Enhanced Suffix Arrays, M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch. Journal of Discrete Algorithms, 2:53-86, 2004.

    28.  
  28. Versatile and Open Software for Comparing Large Genomes, S. Kurtz, A. Phillippy, A.L. Delcher, M. Smoot, M. Shumway, C. Antonescu, and S.L. Salzberg. Genome Biology, 5(R12), 2004.

    29.  
  29. e2g: An Interactive Web-Based Server for Efficiently Mapping large EST and cDNA Sets to Genomic Sequences, J. Krüger, A. Sczyrba, S. Kurtz, and R. Giegerich. Nucleic Acids Res., 32:W301-W304, 2004.

    30.  
  30. Genalyzer: Interactive Visualization of Sequence Similarities Between Entire Genomes, J.V. Choudhuri, C. Schleiermacher, S. Kurtz, and R. Giegerich. Bioinformatics, 20:1964-1965, 2004.

    31.  
  31. PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays, M. Beckstette, D. Strothmann, R. Homann, R. Giegerich, and S. Kurtz. In R. Giegerich and J. Stoye, editors, Proc. of the German Conference on Bioinformatics, GI-Edition, Lecture Notes in Informatics, volume P-53, pages 53-64, 2004.

    32.  
  32. Computational Biology, S. Kurtz and S. Lonardi. In D.P. Mehta and S. Sahni, editors, Handbook on Data Structures and Applications, Computer and Information Science Series. Chapman and Hall/CRC, 2004.

    33.  
  33. Comparative Plant Genomics Resources at PlantGDB, Q. Dong, C.J. Lawrence, S.D. Schlueter, M.D. Wilkerson, S. Kurtz, C. Lushbough, and V. Brendel. Plant Physiology, 139(2):610-618, 2005.

    34.  
  34. Engineering a Software Tool for Gene Prediction in Higher Organisms, G. Gremme, V. Brendel, M.E. Sparks, and S. Kurtz. Information and Software Technology, 47(15):965-978, 2005.

    35.  
  35. A Computational Approach to Search for Non-Coding RNAs in Genomic Data, S. Gräf, J.-H. Teune, D. Strothmann, S. Kurtz, and G. Steger. In W. Nellen and C. Hammann, editors, Small RNAs: Analysis and Regulatory Functions., volume 17 of Nucleic Acids and Molecular Biology, pages 57-74. Springer Verlag, 2006.

    36.  
  36. Enhanced suffix arrays and applications, M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch. In S. Aluru, editor, Handbook on Computational Molecular Biology, pages 7-1-7-27. Chapman and Hall/CRC, 2006.

    37.  
  37. Fast Index based Algorithms and Software for Matching Position Specific Scoring Matrices, M. Beckstette, R. Homann, R. Giegerich, and S. Kurtz. BMC Bioinformatics, 7:389, 2006.

    38.  
  38. Construction of a large signature-tagged mini-Tn5 transposon library and its application to mutagenesis of Sinorhizobium meliloti, N. Pobigaylo, D. Wetter, S. Szymczak, U. Schiller, S. Kurtz, F. Meyer, T.W. Nattkemper, and Becker A. Appl Environ Microbiol., 72(6):4329-4337, 2006.

    39.  
  39. Visualization of syntenic relationships with SynBrowse, V. Brendel, S. Kurtz, and X. Pan. In N.H. Bergman, editor, Comparative Genomics. Methods in Molecular Biology. Humana Press, Totowa, NJ., 2007.

    40.  
  40. Optimized Design and Assessment of Whole Genome Tiling Arrays, S. Gräf, F.G.G. Nielsen, S. Kurtz, M.A. Huynen, E. Birney, H. Stunnenberg, and P. Flicek. submitted to ISMB 2007, 2007.
   Impressum Letzte Aktualisierung: 2009-04-09