25 Search Results for "Kohlbacher, Oliver"


Document
Computational Mass Spectrometry (Dagstuhl Seminar 15351)

Authors: Rudolf Aebersold, Oliver Kohlbacher, and Olga Vitek

Published in: Dagstuhl Reports, Volume 5, Issue 8 (2016)


Abstract
Following in the steps of high-throughput sequencing, mass spectrometry (MS) has become established as a key analytical technique for large-scale studies of complex biological mixtures. MS-based experiments generate datasets of increasing complexity and size, and the rate of production of these datasets has exceeded Moore’s law. In recent years we have witnessed the growth of computational approaches to coping with this data deluge. The seminar 'Computational Mass Spectrometry' brought together mass spectrometrists, statisticians, computer scientists and biologists to discuss where the next set of computational and statistical challenges lie. The participants discussed emerging areas of research such as how to investigate questions in systems biology with the design and analysis of datasets both large in memory usage and number of features and include measurements from multiple ‘omics technologies.

Cite as

Rudolf Aebersold, Oliver Kohlbacher, and Olga Vitek. Computational Mass Spectrometry (Dagstuhl Seminar 15351). In Dagstuhl Reports, Volume 5, Issue 8, pp. 9-33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@Article{aebersold_et_al:DagRep.5.8.9,
  author =	{Aebersold, Rudolf and Kohlbacher, Oliver and Vitek, Olga},
  title =	{{Computational Mass Spectrometry (Dagstuhl Seminar 15351)}},
  pages =	{9--33},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{8},
  editor =	{Aebersold, Rudolf and Kohlbacher, Oliver and Vitek, Olga},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.8.9},
  URN =		{urn:nbn:de:0030-drops-56765},
  doi =		{10.4230/DagRep.5.8.9},
  annote =	{Keywords: computational mass spectrometry, proteomics, metabolomics, bioinformatics}
}
Document
Computational Mass Spectrometry (Dagstuhl Seminar 13491)

Authors: Ruedi Aebersbold, Oliver Kohlbacher, and Olga Vitek

Published in: Dagstuhl Reports, Volume 3, Issue 12 (2014)


Abstract
The last decade has brought tremendous technological advances in mass spectrometry, which in turn have enabled new applications of mass spectrometry in the life sciences. Proteomics, metabolomics, lipidomics, glycomics and related fields have gotten a massive boost, which also resulted in vastly increased amount of data produced and increased complexity of these data sets. An efficient and accurate analysis of these data sets has become the key bottleneck in the field. The seminar 'Computational Mass Spectrometry' brought together scientist from mass spetrometry and bioinformatics, from industry and academia to discuss the state of the art in computational mass spectrometry. The participants discussed a number of current topics, for example new and upcoming technologies, the challenges posed by new types of experiments, the challenges of the growing data volume ('big data'), or challenges for education in several working groups. The seminar reviewed the state of the art in computational mass spectrometry and summarized the upcoming challenges. The seminar also led to the creation of structures to support the computational mass spectrometry community (the formation of an ISCB Community of Interest and a HUPO subgroup on computational mass spectrometry). This community will also carry on with some of the efforts initiated during the seminar, in particular with the establishment of a computational mass spectrometry curriculum that was drafted in Dagstuhl.

Cite as

Ruedi Aebersbold, Oliver Kohlbacher, and Olga Vitek. Computational Mass Spectrometry (Dagstuhl Seminar 13491). In Dagstuhl Reports, Volume 3, Issue 12, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Copy BibTex To Clipboard

@Article{aebersbold_et_al:DagRep.3.12.1,
  author =	{Aebersbold, Ruedi and Kohlbacher, Oliver and Vitek, Olga},
  title =	{{Computational Mass Spectrometry (Dagstuhl Seminar 13491)}},
  pages =	{1--16},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{12},
  editor =	{Aebersbold, Ruedi and Kohlbacher, Oliver and Vitek, Olga},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.12.1},
  URN =		{urn:nbn:de:0030-drops-45053},
  doi =		{10.4230/DagRep.3.12.1},
  annote =	{Keywords: computational mass spectrometry, proteomics, metabolomics, bioinformatics}
}
Document
08101 Abstracts Collection – Computational Proteomics

Authors: Knut Reinert, Christian Huber, Kathrin Marcus, Michal Linial, and Oliver Kohlbacher

Published in: Dagstuhl Seminar Proceedings, Volume 8101, Computational Proteomics (2008)


Abstract
The second Dagstuhl Seminar on emph{Computational Proteomics} took place from March 3rd to 7th, 2008 in Schloss Dagstuhl--Leibniz Center for Informatics. This highly international meeting brought together researchers from computer science and from proteomics to discuss the state of the art and future developments at the interface between experiment and theory. This interdisciplinary exchange covered a wide range of topics, from new experimental methods resulting in more complex data we will have to expect in the future to purely theoretical studies of what level of experimental accuracy is required in order to solve certain problems. A particular focus was also on the application side, where the participants discussed more complex experimental methodologies that are enabled by more sophisticated computational techniques. Quantitative aspects of protein expression analysis as well as posttranslational modifications in the context of disease development and diagnosis were discussed. The seminar sparked a number of new ideas and collaborations and has resulted in several joint grant applications and paper submissions. This paper describes the seminar topics, its goals and results. The executive summary is followed by the abstracts of the presentations given. Links to extended abstracts or full papers are provided, if available.

Cite as

Knut Reinert, Christian Huber, Kathrin Marcus, Michal Linial, and Oliver Kohlbacher. 08101 Abstracts Collection – Computational Proteomics. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 8101, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{reinert_et_al:DagSemProc.08101.1,
  author =	{Reinert, Knut and Huber, Christian and Marcus, Kathrin and Linial, Michal and Kohlbacher, Oliver},
  title =	{{08101 Abstracts  Collection – Computational Proteomics}},
  booktitle =	{Computational Proteomics},
  pages =	{1--34},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8101},
  editor =	{Christian Huber and Oliver Kohlbacher and Michal Linial and Katrin Marcus and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08101.1},
  URN =		{urn:nbn:de:0030-drops-17840},
  doi =		{10.4230/DagSemProc.08101.1},
  annote =	{Keywords: Bioinformatics, biomedicine, proteomics, analytical chemistry}
}
Document
Towards de novo identification of metabolites by analyzing tandem mass spectra

Authors: Sebastian Böcker and Florian Rasche

Published in: Dagstuhl Seminar Proceedings, Volume 8101, Computational Proteomics (2008)


Abstract
Mass spectrometry is among the most widely used technologies in proteomics and metabolomics. For metabolites, de novo interpretation of spectra is even more important than for protein data, because metabolite spectra databases cover only a small fraction of naturally occurring metabolites. In this work, we analyze a method for fully automated de novo identification of metabolites from tandem mass spectra. Mass spectrometry data is usually assumed to be insufficient for identification of molecular structures, so we want to estimate the molecular formula of the unknown metabolite, a crucial step for its identification. This is achieved by calculating the possible formulas of the fragment peaks and then reconstructing the most likely fragmentation tree from this information. We present tests on real mass spectra showing that our algorithms solve the reconstruction problem suitably fast and provide excellent results: For all 32 test compounds the correct solution was among the top five suggestions, for 26 compounds the first suggestion of the exact algorithm was correct.

Cite as

Sebastian Böcker and Florian Rasche. Towards de novo identification of metabolites by analyzing tandem mass spectra. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 8101, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{bocker_et_al:DagSemProc.08101.2,
  author =	{B\"{o}cker, Sebastian and Rasche, Florian},
  title =	{{Towards de novo identification of metabolites by analyzing tandem mass spectra}},
  booktitle =	{Computational Proteomics},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8101},
  editor =	{Christian Huber and Oliver Kohlbacher and Michal Linial and Katrin Marcus and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08101.2},
  URN =		{urn:nbn:de:0030-drops-17839},
  doi =		{10.4230/DagSemProc.08101.2},
  annote =	{Keywords: Tandem mass spectrometry, metabolomics, de novo interpretation}
}
Document
08191 Abstracts Collection – Graph Drawing with Applications to Bioinformatics and Social Sciences

Authors: Stephen Borgatti, Stephen Kobourov, Oliver Kohlbacher, and Petra Mutzel

Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)


Abstract
From May 4 to May 9, 2008, the Dagstuhl Seminar 08191 ``Graph Drawing with Applications to Bioinformatics and Social Sciences'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Stephen Borgatti, Stephen Kobourov, Oliver Kohlbacher, and Petra Mutzel. 08191 Abstracts Collection – Graph Drawing with Applications to Bioinformatics and Social Sciences. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{borgatti_et_al:DagSemProc.08191.1,
  author =	{Borgatti, Stephen and Kobourov, Stephen and Kohlbacher, Oliver and Mutzel, Petra},
  title =	{{08191 Abstracts Collection – Graph Drawing with Applications to Bioinformatics and Social Sciences}},
  booktitle =	{Graph Drawing with Applications to Bioinformatics and Social Sciences},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8191},
  editor =	{Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.1},
  URN =		{urn:nbn:de:0030-drops-15547},
  doi =		{10.4230/DagSemProc.08191.1},
  annote =	{Keywords: Graph drawing, visualization, social sciences, bioinformatics}
}
Document
08191 Executive Summary – Graph Drawing with Applications to Bioinformatics and Social Sciences

Authors: Stephen Borgatti, Stephen Kobourov, Oliver Kohlbacher, and Petra Mutzel

Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)


Abstract
Graph drawing deals with the problem of communicating the structure of relational data through diagrams, or drawings. The ability to represent relational information in a graphical form is a powerful tool which allows to perform analysis through visual exploration to find important patterns, trends, and correlations. Real-world applications such as bioinformatics and sociology pose challenges to the relational visualization because, e.g., semantic information carried by the diagram has to be used for obtaining meaningful layouts and application-specific drawing conventions need to be fulfilled. Moreover, the underlying data often stems from huge data bases, but only a small fraction shall be displayed at a time; the user interactively selects the data to be displayed and explores the graph by expanding interesting and collapsing irrelevant parts. This requires powerful graph exploration tools with navigation capabilities that allow dynamic adaption of the graph layout in real time. In this seminar we focused on the application of graph drawing in two important application domains: bioinformatics and social sciences. We brought together theoreticians and practitioners from these areas and focused on problems concerning interaction with and navigation in large and dynamic networks arising in these application areas; During the seminar, we identified and defined open graph drawing problems that are motivated by practical applications in the targeted application areas, tackled selected open problems, formulated the findings as a first step to the solution, and defined further research directions.

Cite as

Stephen Borgatti, Stephen Kobourov, Oliver Kohlbacher, and Petra Mutzel. 08191 Executive Summary – Graph Drawing with Applications to Bioinformatics and Social Sciences. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{borgatti_et_al:DagSemProc.08191.2,
  author =	{Borgatti, Stephen and Kobourov, Stephen and Kohlbacher, Oliver and Mutzel, Petra},
  title =	{{08191 Executive Summary – Graph Drawing with Applications to Bioinformatics and Social Sciences}},
  booktitle =	{Graph Drawing with Applications to Bioinformatics and Social Sciences},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8191},
  editor =	{Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.2},
  URN =		{urn:nbn:de:0030-drops-15523},
  doi =		{10.4230/DagSemProc.08191.2},
  annote =	{Keywords: Graph drawing, visualization, social sciences, bioinformatics}
}
Document
08191 Working Group Report – Edge Thresholding

Authors: Patrick Healy and Tim Dwyer

Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)


Abstract
When working with very large networks it is typical for scientists to present a ``thinned out'' version of the network in order to avoid the clutter of the entire network. For example in the hypothetical case of illustrating trading patterns between groups of nations it might be appropriate to limit the inclusion of inter-nation edges to all those that are significant in terms of their weight but do not, say, associate with a country outside the grouping. Arising from a discussion during one of the introductory sessions we became interested in a problem relating to the discovery of ``key events'' in a network, in terms of an ordered addition of edges to the network.

Cite as

Patrick Healy and Tim Dwyer. 08191 Working Group Report – Edge Thresholding. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{healy_et_al:DagSemProc.08191.3,
  author =	{Healy, Patrick and Dwyer, Tim},
  title =	{{08191 Working Group Report – Edge Thresholding}},
  booktitle =	{Graph Drawing with Applications to Bioinformatics and Social Sciences},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8191},
  editor =	{Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.3},
  URN =		{urn:nbn:de:0030-drops-15570},
  doi =		{10.4230/DagSemProc.08191.3},
  annote =	{Keywords: Graph drawing, edge thresholding}
}
Document
08191 Working Group Report – Visualization of Trajectories

Authors: Stephen Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen Kobourov, Anna Lubiw, and Dorothea Wagner

Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)


Abstract
We considered the following problem: Given a set of vertices V and a set of paths P, where each path is a sequence of vertices, represent these paths somehow. We explored representations in different dimensions and with different conditions on the paths.

Cite as

Stephen Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen Kobourov, Anna Lubiw, and Dorothea Wagner. 08191 Working Group Report – Visualization of Trajectories. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{borgatti_et_al:DagSemProc.08191.4,
  author =	{Borgatti, Stephen and Brandes, Ulrik and Kaufmann, Michael and Kobourov, Stephen and Lubiw, Anna and Wagner, Dorothea},
  title =	{{08191 Working Group Report – Visualization of Trajectories}},
  booktitle =	{Graph Drawing with Applications to Bioinformatics and Social Sciences},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8191},
  editor =	{Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.4},
  URN =		{urn:nbn:de:0030-drops-15558},
  doi =		{10.4230/DagSemProc.08191.4},
  annote =	{Keywords: Graph drawing, trajectories, paths}
}
Document
08191 Working Group Report – X-graphs of Y-graphs and their Representations

Authors: Vladimir Batagelj, Franz J. Brandenburg, Walter Didimo, Guiseppe Liotta, and Maurizio Patrignani

Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)


Abstract
We address graph decomposition problems that help the hybrid visualization of large graphs, where different graphic metaphors (node-link, matrix, etc.) are used in the same picture. We generalize the $X$-graphs of $Y$-graphs model introduced by Brandenburg (Brandenburg, F.J.: Graph clustering I: Cycles of cliques. In Di Battista, G., ed.: Graph Drawing (Proc. GD '97). Volume 1353 of Lecture Notes Comput. Sci., Springer-Verlag (1997) 158--168) to formalize the problem of automatically identifying dense subgraphs ($Y$-graphs, clusters) that are prone to be collapsed and shown with a matricial representation when needed. We show that (planar, $K_5$)-recognition, that is, the problem of identifying $K_5$ subgraphs such that the graph obtained by collapsing them is planar, is NP-hard. On the positive side, we show that it is possible to determine the highest value of $k$ such that $G$ is a (planar,$k$-core)-graph in $O(m + n log(n))$ time.

Cite as

Vladimir Batagelj, Franz J. Brandenburg, Walter Didimo, Guiseppe Liotta, and Maurizio Patrignani. 08191 Working Group Report – X-graphs of Y-graphs and their Representations. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{batagelj_et_al:DagSemProc.08191.5,
  author =	{Batagelj, Vladimir and Brandenburg, Franz J. and Didimo, Walter and Liotta, Guiseppe and Patrignani, Maurizio},
  title =	{{08191 Working Group Report – X-graphs of Y-graphs and their Representations}},
  booktitle =	{Graph Drawing with Applications to Bioinformatics and Social Sciences},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8191},
  editor =	{Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.5},
  URN =		{urn:nbn:de:0030-drops-15563},
  doi =		{10.4230/DagSemProc.08191.5},
  annote =	{Keywords: Graph drawing, X-graphs of Y-graphs, visualization of large graphs}
}
Document
08191 Working Group Summary – Visually Comparing a Set of Graphs

Authors: Mario Albrecht, Alejandro Estrella-Balderrama, Markus Geyer, Carsten Gutwenger, Karsten Klein, Oliver Kohlbacher, and Michael Schulz

Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)


Abstract
We consider methods to visually compare graphs, more to focus on the differences of the graphs than on the similarities. Our two-level approach constructs a meaningful overview of the given graphs combined with a detailed view focusing on a local area of change. The actual layout of these graphs has to be evaluated depending on the specific type of biological network to be visualized in each case. We look into different variants and propose properties to be optimized in our visualizations.

Cite as

Mario Albrecht, Alejandro Estrella-Balderrama, Markus Geyer, Carsten Gutwenger, Karsten Klein, Oliver Kohlbacher, and Michael Schulz. 08191 Working Group Summary – Visually Comparing a Set of Graphs. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{albrecht_et_al:DagSemProc.08191.6,
  author =	{Albrecht, Mario and Estrella-Balderrama, Alejandro and Geyer, Markus and Gutwenger, Carsten and Klein, Karsten and Kohlbacher, Oliver and Schulz, Michael},
  title =	{{08191 Working Group Summary – Visually Comparing a Set of Graphs}},
  booktitle =	{Graph Drawing with Applications to Bioinformatics and Social Sciences},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8191},
  editor =	{Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.6},
  URN =		{urn:nbn:de:0030-drops-15536},
  doi =		{10.4230/DagSemProc.08191.6},
  annote =	{Keywords: Graph drawing, visual graph comparison}
}
Document
A machine learning approach for prediction of DNA and peptide HPLC retention times

Authors: Marc Sturm, Sascha Quinten, Christian G. Huber, and Oliver Kohlbacher

Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)


Abstract
High performance liquid chromatography (HPLC) has become one of the most efficient methods for the separation of biomolecules. It is an important tool in DNA purification after synthesis as well as DNA quantification. In both cases the separability of different oligonucleotides is essential. The prediction of oligonucleotide retention times prior to the experiment may detect superimposed nucleotides and thereby help to avoid futile experiments. In 2002 Gilar et al. proposed a simple mathematical model for the prediction of DNA retention times, that reliably works at high temperatures only (at least 70°C). To cover a wider temperature rang we incorporated DNA secondary structure information in addition to base composition and length. We used support vector regression (SVR) for the model generation and retention time prediction. A similar problem arises in shotgun proteomics. Here HPLC coupled to a mass spectrometer (MS) is used to analyze complex peptide mixtures (thousands of peptides). Predicting peptide retention times can be used to validate tandem-MS peptide identifications made by search engines like SEQUEST. Recently several methods including multiple linear regression and artificial neural networks were proposed, but SVR has not been used so far.

Cite as

Marc Sturm, Sascha Quinten, Christian G. Huber, and Oliver Kohlbacher. A machine learning approach for prediction of DNA and peptide HPLC retention times. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{sturm_et_al:DagSemProc.05471.3,
  author =	{Sturm, Marc and Quinten, Sascha and Huber, Christian G. and Kohlbacher, Oliver},
  title =	{{A machine learning approach for prediction of DNA and peptide HPLC retention times}},
  booktitle =	{Computational Proteomics},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5471},
  editor =	{Christian G. Huber and Oliver Kohlbacher and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.3},
  URN =		{urn:nbn:de:0030-drops-5484},
  doi =		{10.4230/DagSemProc.05471.3},
  annote =	{Keywords: High performance liquid chromatography, mass spectrometry, retention time, prediction, peptide, DNA, support vector regression}
}
Document
OpenMS - A Framework for Quantitative HPLC/MS-Based Proteomics

Authors: Knut Reinert, Oliver Kohlbacher, Clemens Gröpl, Eva Lange, Ole Schulz-Trieglaff, Marc Sturm, and Nico Pfeifer

Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)


Abstract
In the talk we describe the freely available software library OpenMS which is currently under development at the Freie Universität Berlin and the Eberhardt-Karls Universität Tübingen. We give an overview of the goals and problems in differential proteomics with HPLC and then describe in detail the implemented approaches for signal processing, peak detection and data reduction currently employed in OpenMS. After this we describe methods to identify the differential expression of peptides and propose strategies to avoid MS/MS identification of peptides of interest. We give an overview of the capabilities and design principles of OpenMS and demonstrate its ease of use. Finally we describe projects in which OpenMS will be or was already deployed and thereby demonstrate its versatility.

Cite as

Knut Reinert, Oliver Kohlbacher, Clemens Gröpl, Eva Lange, Ole Schulz-Trieglaff, Marc Sturm, and Nico Pfeifer. OpenMS - A Framework for Quantitative HPLC/MS-Based Proteomics. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{reinert_et_al:DagSemProc.05471.13,
  author =	{Reinert, Knut and Kohlbacher, Oliver and Gr\"{o}pl, Clemens and Lange, Eva and Schulz-Trieglaff, Ole and Sturm, Marc and Pfeifer, Nico},
  title =	{{OpenMS - A Framework for Quantitative HPLC/MS-Based Proteomics}},
  booktitle =	{Computational Proteomics},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5471},
  editor =	{Christian G. Huber and Oliver Kohlbacher and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.13},
  URN =		{urn:nbn:de:0030-drops-5463},
  doi =		{10.4230/DagSemProc.05471.13},
  annote =	{Keywords: Proteomics, C++, Differential expression}
}
Document
05471 Abstract Collection – Computational Proteomics

Authors: Christian G. Huber, Oliver Kohlbacher, and Knut Reinert

Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)


Abstract
From 20.11.05 to 25.11.05, the Dagstuhl Seminar 05471 ``Computational Proteomics'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Christian G. Huber, Oliver Kohlbacher, and Knut Reinert. 05471 Abstract Collection – Computational Proteomics. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{huber_et_al:DagSemProc.05471.1,
  author =	{Huber, Christian G. and Kohlbacher, Oliver and Reinert, Knut},
  title =	{{05471 Abstract Collection – Computational Proteomics}},
  booktitle =	{Computational Proteomics},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5471},
  editor =	{Christian G. Huber and Oliver Kohlbacher and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.1},
  URN =		{urn:nbn:de:0030-drops-5569},
  doi =		{10.4230/DagSemProc.05471.1},
  annote =	{Keywords: Proteomics, mass spectrometry, MALDI, HPLC-MS, differential expression, clinical proteomics, quantitation, identification}
}
Document
05471 Executive Summary – Computational Proteomics

Authors: Christian G. Huber, Oliver Kohlbacher, and Knut Reinert

Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)


Abstract
The Dagstuhl Seminar on Computational Proteomics brought together researchers from computer science and from proteomics to discuss the state of the art and future developments at the interface between experiment and theory. This interdisciplinary exchange covered a wide range of topics, from new experimental methods resulting in more complex data we will have to expect in the future to purely theoretical studies of what level of experimental accuracy is required in order to solve certain problems. A particular focus was also on the application side, where the participants discussed more complex experimental methodologies that are enabled by more sophisticated computational techniques. Quantitative aspects of protein expression analysis as well as posttranslational modifications in the context of disease development and diagnosis were discussed. The seminar sparked a number of new ideas and collaborations and resulted in joint grant applications and publications.

Cite as

Christian G. Huber, Oliver Kohlbacher, and Knut Reinert. 05471 Executive Summary – Computational Proteomics. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{huber_et_al:DagSemProc.05471.2,
  author =	{Huber, Christian G. and Kohlbacher, Oliver and Reinert, Knut},
  title =	{{05471 Executive Summary – Computational Proteomics}},
  booktitle =	{Computational Proteomics},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5471},
  editor =	{Christian G. Huber and Oliver Kohlbacher and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.2},
  URN =		{urn:nbn:de:0030-drops-5406},
  doi =		{10.4230/DagSemProc.05471.2},
  annote =	{Keywords: Proteomics, mass spectrometry, MALDI, HPLC-MS, differential expression, clinical proteomics, quantitation, identification}
}
Document
An Algorithm for Feature Finding in LC/MS Raw Data

Authors: Clemens Gröpl

Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)


Abstract
Liquid chromatography coupled with mass spectrometry is an established method in shotgun proteomics. A key step in the data processing pipeline is to transform the raw data acquired by the mass spectrometer into a list of features. In this context, a emph{feature} is defined as the two-dimensional integration with respect to retention time (RT) and mass-over-charge (m/z) of the eluting signal belonging to a single charge variant of a measurand (e.g., a peptide). Features are characterized by attributes like average mass-to-charge ratio, centroid retention time, intensity, and quality. We present a new algorithm for feature finding which has been developed as a part of a combined experimental and algorithmic approach to absolutely quantify proteins from complex samples with unprecedented precision. The method was applied to the analysis of myoglobin in human blood serum, which is an important diagnostic marker for myocardial infarction. Our approach was able to determine the absolute amount of myoglobin in a serum sample through a series of standard addition experiments with a relative error of 2.5\%. It compares favorably to a manual analysis of the same data set since we could improve the precision and conduct the whole analysis pipeline in a small fraction of the time. We anticipate that our automatic quantitation method will facilitate further absolute or relative quantitation of even more complex peptide samples. The algorithm was implemented in the publicly available software framework OpenMS (www.OpenMS.de)

Cite as

Clemens Gröpl. An Algorithm for Feature Finding in LC/MS Raw Data. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{gropl:DagSemProc.05471.4,
  author =	{Gr\"{o}pl, Clemens},
  title =	{{An Algorithm for Feature Finding in LC/MS Raw Data}},
  booktitle =	{Computational Proteomics},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5471},
  editor =	{Christian G. Huber and Oliver Kohlbacher and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.4},
  URN =		{urn:nbn:de:0030-drops-5341},
  doi =		{10.4230/DagSemProc.05471.4},
  annote =	{Keywords: Computational Proteomics, Quantitative Analysis, Liquid Chromatography, Mass Spectrometry, Algorithm, Software}
}
  • Refine by Author
  • 12 Kohlbacher, Oliver
  • 6 Huber, Christian G.
  • 5 Reinert, Knut
  • 3 Borgatti, Stephen
  • 3 Gröpl, Clemens
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 6 Graph drawing
  • 5 Proteomics
  • 5 mass spectrometry
  • 4 bioinformatics
  • 3 MALDI
  • Show More...

  • Refine by Type
  • 25 document

  • Refine by Publication Year
  • 15 2006
  • 8 2008
  • 1 2014
  • 1 2016

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail