Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Burkhard Morgenstern is active.

Publication


Featured researches published by Burkhard Morgenstern.


Nucleic Acids Research | 1999

MIPS: a database for genomes and protein sequences

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

The Munich Information Center for Protein Sequences (MIPS-GSF, Neuherberg, Germany) continues to provide genome-related information in a systematic way. MIPS supports both national and European sequencing and functional analysis projects, develops and maintains automatically generated and manually annotated genome-specific databases, develops systematic classification schemes for the functional annotation of protein sequences, and provides tools for the comprehensive analysis of protein sequences. This report updates the information on the yeast genome (CYGD), the Neurospora crassa genome (MNCDB), the databases for the comprehensive set of genomes (PEDANT genomes), the database of annotated human EST clusters (HIB), the database of complete cDNAs from the DHGP (German Human Genome Project), as well as the project specific databases for the GABI (Genome Analysis in Plants) and HNB (Helmholtz-Netzwerk Bioinformatik) networks. The Arabidospsis thaliana database (MATDB), the database of mitochondrial proteins (MITOP) and our contribution to the PIR International Protein Sequence Database have been described elsewhere [Schoof et al. (2002) Nucleic Acids Res., 30, 91-93; Scharfe et al. (2000) Nucleic Acids Res., 28, 155-158; Barker et al. (2001) Nucleic Acids Res., 29, 29-32]. All databases described, the protein analysis tools provided and the detailed descriptions of our projects can be accessed through the MIPS World Wide Web server (http://mips.gsf.de).


german conference on bioinformatics | 1999

DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment.

Burkhard Morgenstern

MOTIVATION The performance and time complexity of an improved version of the segment-to-segment approach to multiple sequence alignment is discussed. In this approach, alignments are composed from gap-free segment pairs, and the score of an alignment is defined as the sum of so-called weights of these segment pairs. RESULTS A modification of the weight function used in the original version of the alignment program DIALIGN has two important advantages: it can be applied to both globally and locally related sequence sets, and the running time of the program is considerably improved. The time complexity of the algorithm is discussed theoretically, and the program running time is reported for various test examples. AVAILABILITY The program is available on-line at the Bielefeld University Bioinformatics Server (BiBiServ) http://bibiserv.TechFak.Uni-Bielefeld.DE/dial ign/


Nucleic Acids Research | 2004

AUGUSTUS: a web server for gene finding in eukaryotes

Mario Stanke; Rasmus Steinkamp; Stephan Waack; Burkhard Morgenstern

We present a www server for AUGUSTUS, a novel software program for ab initio gene prediction in eukaryotic genomic sequences. Our method is based on a generalized Hidden Markov Model with a new method for modeling the intron length distribution. This method allows approximation of the true intron length distribution more accurately than do existing programs. For genomic sequence data from human and Drosophila melanogaster, the accuracy of AUGUSTUS is superior to existing gene-finding approaches. The advantage of our program becomes apparent especially for larger input sequences containing more than one gene. The server is available at http://augustus.gobics.de.


Nature Biotechnology | 2007

Comparative analysis of the complete genome sequence of the plant growth-promoting bacterium Bacillus amyloliquefaciens FZB42.

Xiao Hua Chen; Alexandra Koumoutsi; Romy Scholz; Andreas Eisenreich; Kathrin Schneider; Isabelle Heinemeyer; Burkhard Morgenstern; Björn Voss; Wolfgang R. Hess; Oleg N. Reva; Helmut Junge; Birgit Voigt; Peter R. Jungblut; Joachim Vater; Roderich D. Süssmuth; Heiko Liesegang; Axel Strittmatter; Gerhard Gottschalk; Rainer Borriss

Bacillus amyloliquefaciens FZB42 is a Gram-positive, plant-associated bacterium, which stimulates plant growth and produces secondary metabolites that suppress soil-borne plant pathogens. Its 3,918-kb genome, containing an estimated 3,693 protein-coding sequences, lacks extended phage insertions, which occur ubiquitously in the closely related Bacillus subtilis 168 genome. The B. amyloliquefaciens FZB42 genome reveals an unexpected potential to produce secondary metabolites, including the polyketides bacillaene and difficidin. More than 8.5% of the genome is devoted to synthesizing antibiotics and siderophores by pathways not involving ribosomes. Besides five gene clusters, known from B. subtilis to mediate nonribosomal synthesis of secondary metabolites, we identified four giant gene clusters absent in B. subtilis 168. The pks2 gene cluster encodes the components to synthesize the macrolactin core skeleton.


Nucleic Acids Research | 2006

AUGUSTUS: ab initio prediction of alternative transcripts

Mario Stanke; Oliver Keller; Irfan Gunduz; Alec Hayes; Stephan Waack; Burkhard Morgenstern

AUGUSTUS is a software tool for gene prediction in eukaryotes based on a Generalized Hidden Markov Model, a probabilistic model of a sequence and its gene structure. Like most existing gene finders, the first version of AUGUSTUS returned one transcript per predicted gene and ignored the phenomenon of alternative splicing. Herein, we present a WWW server for an extended version of AUGUSTUS that is able to predict multiple splice variants. To our knowledge, this is the first ab initio gene finder that can predict multiple transcripts. In addition, we offer a motif searching facility, where user-defined regular expressions can be searched against putative proteins encoded by the predicted genes. The AUGUSTUS web interface and the downloadable open-source stand-alone program are freely available from .


german conference on bioinformatics | 1998

DIALIGN: finding local similarities by multiple sequence alignment.

Burkhard Morgenstern; Kornelie Frech; Andreas W. M. Dress; Thomas Werner

MOTIVATION DIALIGN is a new method for pairwise as well as multiple alignment of nucleic acid and protein sequences. While standard alignment programs rely on comparing single residues and imposing gap penalties, DIALIGN constructs alignments by comparing whole segments of the sequences. No gap penalty is employed. This point of view is especially adequate if sequences are not globally related, but share only local similarities, as is the case in genomic DNA sequences and in many protein families. RESULTS Using four different data sets, we show that DIALIGN is able correctly to align conserved motifs in protein sequences. Alignments produced by DIALIGN are compared systematically to the results of five other alignment programs. AVAILABILITY DIALIGN is available to the scientific community free of charge for non-commercial use. Executables for various UNIX platforms including LINUX can be downloaded at http://www.gsf.de/biodv/dialign.html CONTACT werner, [email protected]


BMC Bioinformatics | 2006

Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources.

Mario Stanke; Oliver Schöffmann; Burkhard Morgenstern; Stephan Waack

BackgroundIn order to improve gene prediction, extrinsic evidence on the gene structure can be collected from various sources of information such as genome-genome comparisons and EST and protein alignments. However, such evidence is often incomplete and usually uncertain. The extrinsic evidence is usually not sufficient to recover the complete gene structure of all genes completely and the available evidence is often unreliable. Therefore extrinsic evidence is most valuable when it is balanced with sequence-intrinsic evidence.ResultsWe present a fairly general method for integration of external information. Our method is based on the evaluation of hints to potentially protein-coding regions by means of a Generalized Hidden Markov Model (GHMM) that takes both intrinsic and extrinsic information into account. We used this method to extend the ab initio gene prediction program AUGUSTUS to a versatile tool that we call AUGUSTUS+. In this study, we focus on hints derived from matches to an EST or protein database, but our approach can be used to include arbitrary user-defined hints. Our method is only moderately effected by the length of a database match. Further, it exploits the information that can be derived from the absence of such matches. As a special case, AUGUSTUS+ can predict genes under user-defined constraints, e.g. if the positions of certain exons are known. With hints from EST and protein databases, our new approach was able to predict 89% of the exons in human chromosome 22 correctly.ConclusionSensitive probabilistic modeling of extrinsic evidence such as sequence database matches can increase gene prediction accuracy. When a match of a sequence interval to an EST or protein sequence is used it should be treated as compound information rather than as information about individual positions.


Nucleic Acids Research | 2005

AUGUSTUS: a web server for gene prediction in eukaryotes that allows user-defined constraints

Mario Stanke; Burkhard Morgenstern

We present a WWW server for AUGUSTUS, a software for gene prediction in eukaryotic genomic sequences that is based on a generalized hidden Markov model, a probabilistic model of a sequence and its gene structure. The web server allows the user to impose constraints on the predicted gene structure. A constraint can specify the position of a splice site, a translation initiation site or a stop codon. Furthermore, it is possible to specify the position of known exons and intervals that are known to be exonic or intronic sequence. The number of constraints is arbitrary and constraints can be combined in order to pin down larger parts of the predicted gene structure. The result then is the most likely gene structure that complies with all given user constraints, if such a gene structure exists. The specification of constraints is useful when part of the gene structure is known, e.g. by expressed sequence tag or protein sequence alignments, or if the user wants to change the default prediction. The web interface and the downloadable stand-alone program are available free of charge at .


Molecular Biology and Evolution | 2010

Improved Phylogenomic Taxon Sampling Noticeably Affects Nonbilaterian Relationships

Kerstin Pick; Hervé Philippe; F. Schreiber; Dirk Erpenbeck; Daniel J. Jackson; P. Wrede; Matthias Wiens; Alexandre Alié; Burkhard Morgenstern; Michaël Manuel; Gert Wörheide

Despite expanding data sets and advances in phylogenomic methods, deep-level metazoan relationships remain highly controversial. Recent phylogenomic analyses depart from classical concepts in recovering ctenophores as the earliest branching metazoan taxon and propose a sister-group relationship between sponges and cnidarians (e.g., Dunn CW, Hejnol A, Matus DQ, et al. (18 co-authors). 2008. Broad phylogenomic sampling improves resolution of the animal tree of life. Nature 452:745–749). Here, we argue that these results are artifacts stemming from insufficient taxon sampling and long-branch attraction (LBA). By increasing taxon sampling from previously unsampled nonbilaterians and using an identical gene set to that reported by Dunn et al., we recover monophyletic Porifera as the sister group to all other Metazoa. This suggests that the basal position of the fast-evolving Ctenophora proposed by Dunn et al. was due to LBA and that broad taxon sampling is of fundamental importance to metazoan phylogenomic analyses. Additionally, saturation in the Dunn et al. character set is comparatively high, possibly contributing to the poor support for some nonbilaterian nodes.


Nucleic Acids Research | 2004

DIALIGN: multiple DNA and protein sequence alignment at BiBiServ

Burkhard Morgenstern

DIALIGN is a widely used software tool for multiple DNA and protein sequence alignment. The program combines local and global alignment features and can therefore be applied to sequence data that cannot be correctly aligned by more traditional approaches. DIALIGN is available online through Bielefeld Bioinformatics Server (BiBiServ). The downloadable version of the program offers several new program features. To compare the output of different alignment programs, we developed the program AltAVisT. Our software is available at http://bibiserv.TechFak.Uni-Bielefeld.DE/dialign/.

Collaboration


Dive into the Burkhard Morgenstern's collaboration.

Top Co-Authors

Avatar

Mario Stanke

University of Greifswald

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Peter Meinicke

University of Göttingen

View shared research outputs
Top Co-Authors

Avatar

Andreas W. M. Dress

CAS-MPG Partner Institute for Computational Biology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Maike Tech

University of Göttingen

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Thomas Lingner

University of Göttingen

View shared research outputs
Top Co-Authors

Avatar

Bette T. Korber

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar

Ingo Bulla

Los Alamos National Laboratory

View shared research outputs
Researchain Logo
Decentralizing Knowledge