gobics.de [Burkhard Morgenstern]


University of Göttingen - Faculty of Biology - Institute of Microbiology and Genetics - Department of Bioinformatics

Prof. Dr. Burkhard Morgenstern
Universität Göttingen
Institut für Mikrobiologie und Genetik
Abteilung für Bioinformatik
Goldschmidtstr. 1, Raum 2.167
37077 Göttingen
Germany

My spam-protected E-mail is:
bmorgen AT gwdg DOT de

Phone: +49 551 39-21165
Secretary: +49 551 39-14966


Me on Twitter


The Göttingen Bioinformatics community on Twitter

Our new software tools for alignment-free sequence comparison and seed optimization:
Prot-SpaM, Multi-SpaM, Filtered Spaced-Word Matches, Slope-SpaM, kmacs and rasbhari.


Visit our journal: Algorithms for Molecular Biology


Recent Publications (for publication metrics and related nonsense, see Google Scholar, publons, Research Gate)
  • S. Röhling, A. Linne, J. Schellhorn, M. Hosseini, T. Dencker, B. Morgenstern (2020)
    The number of k-mer matches between two DNA sequences as a function of k and applications to estimate phylogenetic distances
    PLOS ONE, accepted for publication. Preprint available here
  • B. Morgenstern (2020)
    Sequence Comparison without Alignment: The SpaM approaches
    In: K. Katoh (ed.) Multiple Sequence Alignment (to appear)
    Book series Methods in Molecular Biology, Springer. Preprint available here
  • T. Dencker, C.-A. Leimeister, M. Gerth, C. Bleidorn, S. Snir, B. Morgenstern (2020)
    Multi-SpaM: a Maximum-Likelihood approach to Phylogeny reconstruction using Multiple Spaced-word Matches
    and Quartet Trees
    NAR Genomics and Bioinformatics 2, lqz013
  • B. Morgenstern (2020)
    Fake scientists on editorial boards can significantly enhance the visibility of junk journals.
    In: Mario Biagioli and Alexandra Lippman (Eds.)
    Gaming the Metrics: Misconduct and Manipulation in Academic Research, MIT Press, pp. 201-211.
    Book freely available as PDF, follow link "Open Access" in the middle of this page. Slides of my talk available here
  • M. Hosseini, D. Pratas, B Morgenstern, A.J. Pinho (2019)
    Smash++: an alignment-free and memory-efficient tool to find genomic rearrangements
    bioRxiv, doi:10.1101/2019.12.23.887349
  • A. Chakraborty, B. Morgenstern, S. Bandyopadhyay (2019)
    S-conLSH: Alignment-free gapped mapping of noisy long reads
    bioRxiv, doi:10.1101/801118v1
  • A.K. Lau, S. Dörrer, C.-A. Leimeister, C. Bleidorn, B. Morgenstern (2019)
    Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage
    BMC Bioinformatics 20, 638 (Proceedings RECOMB-CG 2019)
  • B. Morgenstern (2019)
    Der Metrik-Wahn
    Laborjournal 7-8, 22-25
  • A. Zielezinski, H.Z. Girgis, G. Bernard, C.-A. Leimeister, K. Tang, T. Dencker, A.K. Lau, S. Röhling, J. Choi, M.S. Waterman, M. Comin, S.-H. Kim, S. Vinga, J.S. Almeida, C.X. Chan, B. James, F. Sun, B. Morgenstern, W.M. Karlowski (2019)
    Benchmarking of alignment-free sequence comparison methods
    Genome Biology 20, 144
  • C.-A. Leimeister, T. Dencker, B. Morgenstern (2019)
    Accurate multiple alignment of distantly related genome sequences using Filtered Spaced Word Matches as anchor points
    Bioinformatics 35, 211-218
  • C.-A. Leimeister, J. Schellhorn, S. Dörrer, M. Gerth, C. Bleidorn, B. Morgenstern (2019)
    Prot-SpaM: Fast alignment-free phylogeny reconstruction based on whole-proteome sequences
    GigaScience 8, giy148.


Short CV

Created by Burkhard Morgenstern. Last modified: January 2020