![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Burkhard Morgenstern
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j56]Niklas Birth
, Thomas Dencker, Burkhard Morgenstern
:
Insertions and deletions as phylogenetic signal in an alignment-free context. PLoS Comput. Biol. 18(8) (2022) - 2021
- [j55]Angana Chakraborty, Burkhard Morgenstern, Sanghamitra Bandyopadhyay
:
S-conLSH: alignment-free gapped mapping of noisy long reads. BMC Bioinform. 22(1): 64 (2021)
2010 – 2019
- 2019
- [j54]Chris-André Leimeister, Thomas Dencker, Burkhard Morgenstern:
Accurate multiple alignment of distantly related genome sequences using filtered spaced word matches as anchor points. Bioinform. 35(2): 211-218 (2019) - [j53]Anna-Katharina Lau, Svenja Dörrer, Chris-André Leimeister, Christoph Bleidorn, Burkhard Morgenstern:
Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage. BMC Bioinform. 20-S(20): 638 (2019) - 2018
- [c13]Thomas Dencker, Chris-André Leimeister, Michael Gerth, Christoph Bleidorn, Sagi Snir, Burkhard Morgenstern:
Multi-SpaM: A Maximum-Likelihood Approach to Phylogeny Reconstruction Using Multiple Spaced-Word Matches and Quartet Trees. RECOMB-CG 2018: 227-241 - 2017
- [j52]Burkhard Morgenstern
, Svenja Schöbel, Chris-André Leimeister:
Phylogeny reconstruction based on the length distribution of k-mismatch common substrings. Algorithms Mol. Biol. 12(1): 27:1-27:12 (2017) - [j51]Chris-André Leimeister, Salma Sohrabi-Jahromi
, Burkhard Morgenstern:
Fast and accurate phylogeny reconstruction using filtered spaced-word matches. Bioinform. 33(7): 971-979 (2017) - 2016
- [j50]Lars Hahn
, Chris-André Leimeister, Rachid Ounit
, Stefano Lonardi
, Burkhard Morgenstern:
rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison. PLoS Comput. Biol. 12(10) (2016) - 2015
- [j49]Burkhard Morgenstern, Binyao Zhu, Sebastian Horwege, Chris Leimeister:
Estimating evolutionary distances between genomic sequences from spaced-word matches. Algorithms Mol. Biol. 10: 5 (2015) - [i1]Lars Hahn, Chris-André Leimeister, Burkhard Morgenstern:
RasBhari: optimizing spaced seeds for database searching, read mapping and alignment-free sequence comparison. CoRR abs/1511.04001 (2015) - 2014
- [j48]Chris-André Leimeister, Marcus Boden, Sebastian Horwege, Sebastian Lindner
, Burkhard Morgenstern:
Fast alignment-free sequence comparison using spaced-word frequencies. Bioinform. 30(14): 1991-1999 (2014) - [j47]Chris-André Leimeister, Burkhard Morgenstern:
kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinform. 30(14): 2000-2008 (2014) - [j46]Sebastian Horwege, Sebastian Lindner
, Marcus Boden, Klas Hatje, Martin Kollmar
, Chris-André Leimeister, Burkhard Morgenstern:
Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucleic Acids Res. 42(Webserver-Issue): 7-11 (2014) - [c12]Burkhard Morgenstern, Binyao Zhu, Sebastian Horwege, Chris-André Leimeister:
Estimating Evolutionary Distances from Spaced-Word Matches. WABI 2014: 161-173 - [e2]Daniel G. Brown, Burkhard Morgenstern:
Algorithms in Bioinformatics - 14th International Workshop, WABI 2014, Wroclaw, Poland, September 8-10, 2014. Proceedings. Lecture Notes in Computer Science 8701, Springer 2014, ISBN 978-3-662-44752-9 [contents] - 2013
- [j45]Layal Al Ait, Zaher Yamak, Burkhard Morgenstern:
DIALIGN at GOBICS - multiple sequence alignment using various sources of external information. Nucleic Acids Res. 41(Webserver-Issue): 3-7 (2013) - [c11]Marcus Boden, Martin Schöneich, Sebastian Horwege, Sebastian Lindner
, Chris Leimeister, Burkhard Morgenstern:
Alignment-free sequence comparison with spaced k-mers. GCB 2013: 24-34 - [e1]Tim Beißbarth, Martin Kollmar, Andreas Leha, Burkhard Morgenstern, Anne-Kathrin Schultz, Stephan Waack, Edgar Wingender:
German Conference on Bioinformatics 2013, GCB 2013, September 10-13, 2013, Göttingen, Germany. OASIcs 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-59-0 [contents] - 2012
- [j44]Anne-Kathrin Schultz
, Ingo Bulla, Mariama Abdou-Chekaraou, Emmanuel Gordien, Burkhard Morgenstern, Fabien Zoulim, Paul Dény, Mario Stanke:
jpHMM: recombination analysis in viruses with circular genomes such as the hepatitis B virus. Nucleic Acids Res. 40(Web-Server-Issue): 193-198 (2012) - [c10]Layal Al Ait, Eduardo Corel
, Burkhard Morgenstern:
Using protein-domain information for multiple sequence alignment. BIBE 2012: 163-168 - 2011
- [j43]Thomas Unterthiner
, Anne-Kathrin Schultz
, Jan Bulla, Burkhard Morgenstern
, Mario Stanke, Ingo Bulla:
Detection of viral sequence fragments of HIV-1 subfamilies yet unknown. BMC Bioinform. 12: 93 (2011) - [j42]Cong V. C. Truong, Linn F. Groeneveld
, Burkhard Morgenstern, Eildert Groeneveld:
MolabIS - An Integrated Information System for Storing and Managing Molecular Genetics Data. BMC Bioinform. 12: 425 (2011) - 2010
- [j41]Eduardo Corel
, Florian Pitschi, Burkhard Morgenstern:
A min-cut algorithm for the consistency problem in multiple sequence alignment. Bioinform. 26(8): 1015-1021 (2010) - [j40]Ingo Bulla, Anne-Kathrin Schultz
, Fabian Schreiber
, Ming Zhang, Thomas Leitner, Bette T. Korber
, Burkhard Morgenstern, Mario Stanke:
HIV classification using the coalescent theory. Bioinform. 26(11): 1409-1415 (2010) - [j39]Amarendran Ramaswami Subramanian, Suvrat Hiran, Rasmus Steinkamp, Peter Meinicke, Eduardo Corel
, Burkhard Morgenstern:
DIALIGN-TX and multiple protein alignment using secondary structure information at GOBICS. Nucleic Acids Res. 38(Web-Server-Issue): 19-22 (2010)
2000 – 2009
- 2009
- [j38]Fabian Schreiber
, Kerstin Pick, Dirk Erpenbeck, Gert Wörheide
, Burkhard Morgenstern
:
OrthoSelect: a protocol for selecting orthologous groups in phylogenomics. BMC Bioinform. 10 (2009) - [j37]Dietmar Sommerfeld, Thomas Lingner, Mario Stanke, Burkhard Morgenstern, Harald Richter:
AUGUSTUS at MediGRID: Adaption of a bioinformatics application to grid computing for efficient genome analysis. Future Gener. Comput. Syst. 25(3): 337-345 (2009) - [j36]Fabian Schreiber
, Gert Wörheide
, Burkhard Morgenstern:
OrthoSelect: a web server for selecting orthologous gene alignments from EST sequences. Nucleic Acids Res. 37(Web-Server-Issue): 185-188 (2009) - [j35]Anne-Kathrin Schultz
, Ming Zhang, Ingo Bulla, Thomas Leitner, Bette T. Korber
, Burkhard Morgenstern, Mario Stanke:
jpHMM: Improving the reliability of recombination prediction in HIV-1. Nucleic Acids Res. 37(Web-Server-Issue): 647-651 (2009) - 2008
- [j34]Peter Meinicke, Thomas Lingner, Alexander Kaever, Kirstin Feussner, Cornelia Göbel, Ivo Feussner
, Petr Karlovsky
, Burkhard Morgenstern:
Metabolite-based clustering and visualization of mass spectrometry data using one-dimensional self-organizing maps. Algorithms Mol. Biol. 3 (2008) - [j33]Amarendran Ramaswami Subramanian, Michael Kaufmann, Burkhard Morgenstern
:
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms Mol. Biol. 3 (2008) - [j32]Holger Wagner, Burkhard Morgenstern
, Andreas W. M. Dress:
Stability of multiple alignments and phylogenetic trees: an analysis of ABC-transporter proteins family. Algorithms Mol. Biol. 3 (2008) - [j31]Katharina Jasmin Hoff
, Maike Tech, Thomas Lingner, Rolf Daniel
, Burkhard Morgenstern
, Peter Meinicke:
Gene prediction in metagenomic fragments: A large scale machine learning approach. BMC Bioinform. 9 (2008) - 2006
- [j30]Burkhard Morgenstern
, Sonja J. Prohaska, Dirk Pöhler, Peter F. Stadler
:
Multiple sequence alignment with user-defined anchor points. Algorithms Mol. Biol. 1 (2006) - [j29]Burkhard Morgenstern
, Peter F. Stadler
:
New journal: Algorithms for Molecular Biology. Algorithms Mol. Biol. 1 (2006) - [j28]Mario Stanke, Oliver Schöffmann, Burkhard Morgenstern
, Stephan Waack:
Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources. BMC Bioinform. 7: 62 (2006) - [j27]Anne-Kathrin Schultz
, Ming Zhang, Thomas Leitner, Carla Kuiken, Bette T. Korber
, Burkhard Morgenstern
, Mario Stanke:
A jumping profile Hidden Markov Model and applications to recombination sites in HIV and HCV genomes. BMC Bioinform. 7: 265 (2006) - [j26]Mario Stanke, Oliver Keller, Irfan Gunduz, Alec Hayes, Stephan Waack, Burkhard Morgenstern:
AUGUSTUS: ab initio prediction of alternative transcripts. Nucleic Acids Res. 34(Web-Server-Issue): 435-439 (2006) - [j25]Ming Zhang, Anne-Kathrin Schultz
, Charles Calef, Carla Kuiken, Thomas Leitner, Bette T. Korber
, Burkhard Morgenstern, Mario Stanke:
jpHMM at GOBICS: a web server to detect genomic recombinations in HIV-1. Nucleic Acids Res. 34(Web-Server-Issue): 463-465 (2006) - [j24]Maike Tech, Burkhard Morgenstern, Peter Meinicke:
TICO: a tool for postprocessing the predictions of prokaryotic translation initiation sites. Nucleic Acids Res. 34(Web-Server-Issue): 588-590 (2006) - 2005
- [j23]Burkhard Morgenstern, Nadine Werner, Sonja J. Prohaska, Rasmus Steinkamp, Isabelle Schneider, Amarendran Ramaswami Subramanian, Peter F. Stadler
, Jan Weyer-Menkhoff:
Multiple sequence alignment with user-defined constraints at GOBICS. Bioinform. 21(7): 1271-1273 (2005) - [j22]Maike Tech, Nico Pfeifer
, Burkhard Morgenstern, Peter Meinicke:
TICO: a tool for improving predictions of prokaryotic translation initiation sites. Bioinform. 21(17): 3568-3569 (2005) - [j21]Amarendran Ramaswami Subramanian, Jan Weyer-Menkhoff, Michael Kaufmann, Burkhard Morgenstern
:
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. BMC Bioinform. 6: 66 (2005) - [j20]Mario Stanke, Burkhard Morgenstern:
AUGUSTUS: a web server for gene prediction in eukaryotes that allows user-defined constraints. Nucleic Acids Res. 33(Web-Server-Issue): 465-467 (2005) - [j19]Dirk Pöhler, Nadine Werner, Rasmus Steinkamp, Burkhard Morgenstern:
Multiple alignment of genomic sequences using CHAOS, DIALIGN and ABC. Nucleic Acids Res. 33(Web-Server-Issue): 532-534 (2005) - 2004
- [j18]Martin Schmollinger, Kay Nieselt
, Michael Kaufmann, Burkhard Morgenstern
:
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors. BMC Bioinform. 5: 128 (2004) - [j17]Peter Meinicke, Maike Tech, Burkhard Morgenstern
, Rainer Merkl
:
Oligo kernels for datamining on biological sequences: a case study on prokaryotic translation initiation sites. BMC Bioinform. 5: 169 (2004) - [j16]Burkhard Morgenstern:
DIALIGN: multiple DNA and protein sequence alignment at BiBiServ. Nucleic Acids Res. 32(Web-Server-Issue): 33-36 (2004) - [j15]Michael Brudno, Rasmus Steinkamp, Burkhard Morgenstern:
The CHAOS/DIALIGN WWW server for multiple alignment of genomic sequences. Nucleic Acids Res. 32(Web-Server-Issue): 41-44 (2004) - [j14]Leila Taher
, Oliver Rinner, Saurabh Garg, Alexander Sczyrba
, Burkhard Morgenstern:
AGenDA: gene prediction by cross-species sequence comparison. Nucleic Acids Res. 32(Web-Server-Issue): 305-308 (2004) - [j13]Mario Stanke, Rasmus Steinkamp, Stephan Waack, Burkhard Morgenstern:
AUGUSTUS: a web server for gene finding in eukaryotes. Nucleic Acids Res. 32(Web-Server-Issue): 309-312 (2004) - [c9]Burkhard Morgenstern, Sonja J. Prohaska, Nadine Werner, Jan Weyer-Menkhoff, Isabelle Schneider, Amarendran Ramaswami Subramanian, Peter F. Stadler:
Multiple sequence alignment with user-defined constraints. German Conference on Bioinformatics 2004: 25-36 - 2003
- [j12]Burkhard Morgenstern, Sachin Goel, Alexander Sczyrba
, Andreas W. M. Dress:
AltAVisT: Comparing alternative multiple sequence alignments. Bioinform. 19(3): 425-426 (2003) - [j11]Leila Taher
, Oliver Rinner, Saurabh Garg, Alexander Sczyrba
, Michael Brudno, Serafim Batzoglou, Burkhard Morgenstern:
AGenDA: homology-based gene prediction. Bioinform. 19(12): 1575-1577 (2003) - [j10]Michael Brudno, Michael Chapman, Berthold Göttgens
, Serafim Batzoglou, Burkhard Morgenstern
:
Fast and sensitive multiple alignment of large genomic sequences. BMC Bioinform. 4: 66 (2003) - [c8]Michael Sammeth, Burkhard Morgenstern, Jens Stoye:
Divide-and-conquer multiple alignment with segment-based constraints. ECCB 2003: 189-195 - 2002
- [j9]Burkhard Morgenstern:
A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences. Appl. Math. Lett. 15(1): 11-16 (2002) - [j8]Burkhard Morgenstern, Oliver Rinner, Saïd Abdeddaïm, Dirk Haase, Klaus F. X. Mayer, Andreas W. M. Dress, Hans-Werner Mewes
:
Exon discovery by genomic sequence alignment. Bioinform. 18(6): 777-787 (2002) - [j7]Oliver Rinner, Burkhard Morgenstern:
AGenDA: Gene prediction by comparative sequence analysis. Silico Biol. 2(3): 195-205 (2002) - [j6]Hans-Werner Mewes, Dmitrij Frishman, Ulrich Güldener
, Gertrud Mannhaupt, Klaus F. X. Mayer, Martin Mokrejs
, Burkhard Morgenstern, Martin Münsterkötter
, Stephen Rudd, B. Weil:
MIPS: a database for genomes and protein sequences. Nucleic Acids Res. 30(1): 31-34 (2002) - [c7]Michael Brudno, Burkhard Morgenstern:
Fast and Sensitive Alignment of Large Genomic Sequences. CSB 2002: 138- - 2001
- [j5]Birgitta Geier, Gabi Kastenmüller
, Matthias Fellenberg, Hans-Werner Mewes
, Burkhard Morgenstern:
The HIB database of annotated UniGene clusters. Bioinform. 17(6): 571-572 (2001) - [c6]Oliver Rinner, Burkhard Morgenstern:
Gene prediction by comparative sequence analysis. German Conference on Bioinformatics 2001: 131-134 - 2000
- [j4]Burkhard Morgenstern:
A space-efficient algorithm for aligning large genomic sequences. Bioinform. 16(10): 948-949 (2000) - [c5]Saïd Abdeddaïm, Burkhard Morgenstern:
Speeding Up the DIALIGN Multiple Alignment Program by Using the 'Greedy Alignment of BIOlogical Sequences LIBrary' (GABIOS-LIB). JOBIM 2000: 1-11
1990 – 1999
- 1999
- [j3]Hans-Peter Lenhof, Burkhard Morgenstern, Knut Reinert
:
An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinform. 15(3): 203-210 (1999) - [j2]Burkhard Morgenstern:
DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinform. 15(3): 211-218 (1999) - 1998
- [j1]Burkhard Morgenstern, Kornelie Frech, Andreas W. M. Dress, Thomas Werner:
DIALIGN: finding local similarities by multiple sequence alignment. Bioinform. 14(3): 290-294 (1998) - [c4]Burkhard Morgenstern:
DIALIGN2: Improvement of the segment to segment approach to multiple sequence alignment. German Conference on Bioinformatics 1998 - [c3]Knut Reinert, Hans-Peter Lenhof, Burkhard Morgenstern:
An exact solution for the Segment-to-Segment multiple sequence alignment problem. German Conference on Bioinformatics 1998 - [c2]Burkhard Morgenstern, William R. Atchley, Klaus Hahn, Andreas W. M. Dress:
Segment-Based Scores for Pairwise and Multiple Sequence Alignments. ISMB 1998: 115-121 - 1997
- [c1]Burkhard Morgenstern, Thomas Werner:
Dialign 1.0: Multiple alignment by Segment rather than by Position comparison. German Conference on Bioinformatics 1997: 69-71 - 1996
- [b1]Burkhard Morgenstern:
Sequenzalignment auf der Basis von Segmentvergleichen. Bielefeld University, Germany, 1996, pp. 1-74
Coauthor Index
aka: Chris Leimeister
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint