Thomas Gatter

Mr. Thomas Gatter


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 November 2015 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
JIJon Ison
Jon Ison
KRKristoffer Rapacki
Kristoffer Rapacki
HMHervé Ménager
Hervé Ménager
MKMatúš Kalaš
Matúš Kalaš
EREmil Rydza
Emil Rydza
SBSøren Brunak
Søren Brunak
Life sciences are yielding huge data sets that underpin scientific discoveries fundamental to improvement in human health, agriculture and the environment. In support of these discoveries, a plethora of databases and tools are deployed, in technically complex and diverse implementations, across a spectrum of scientific disciplines. The corpus of documentation of these resources is fragmented across the Web, with much redundancy, and has lacked a common standard of information. The outcome is that scientists must often struggle to find, understand, compare and use the best resources for the task at hand. Here we present a community-driven curation effort, supported by ELIXIR—the European infrastructure for biological information—that aspires to a comprehensive and consistent registry of information about bioinformatics resources. The sustainable upkeep of this Tools and Data Services Registry is assured by a curation effort driven by and tailored to local needs, and shared amongst a network of engaged partners. As of November 2015, the registry includes 1785 resources, with depositions from 126 individual registrations including 52 institutional providers and 74 individuals. With community support, the registry can become a standard for dissemination of information about bioinformatics resources: we welcome everyone to join us in this common endeavour. The registry is freely available at https://bio.tools.

16 April 2019 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
TGThomas Gatter
Thomas Gatter
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
The rapid increase in High-throughput sequencing of RNA (RNA-seq) has led to tremendous improvements in the detection and reconstruction of both expressed coding and non-coding RNA transcripts. Yet, the complete and accurate annotation of the complex transcriptional output of not only the human genome has remained elusive. One of the critical bottlenecks in this endeavor is the computational reconstruction of transcript structures, due to high noise levels, technological limits, and other biases in the raw data. We introduce several new and improved algorithms in a novel workflow for transcript assembly and quantification. We propose an extension of the common splice graph framework that combines aspects of overlap and bin graphs and makes it possible to efficiently use both multi-splice and paired-end information to the fullest extent. Phasing information of reads is used to further resolve loci. The decomposition of read coverage patterns is modeled as a minimum-cost flow problem to account for the unavoidable non-uniformities of RNA-seq data. Its performance compares favorably with state of the art methods on both simulated and real-life datasets. Ryūtō calls 1−4% more true transcripts, while calling 5−35% less false predictions compared to the next best competitor.

16 September 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
MLMarcos E. González Laffitte
Marcos E. González Laffitte
KWKlaus Weinbauer
Klaus Weinbauer
TPTieu-Long Phan
Tieu-Long Phan
NBNora Beier
Nora Beier
NDNico Domschke
Nico Domschke
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
Atom-to-atom maps (AAMs) are bijections that establish the correspondence of reactant and product atoms across chemical reactions. They capture crucial features of the reaction mechanism and thus play a central role in modeling chemistry at the level of graph transformations. AAMs are equivalent to so-called “imaginary transition state” (ITS) graphs, making it possible to reduce tasks such as the computational comparison of AAMs to testing graph isomorphisms. In many application scenarios, nonetheless, only partial information is available, i.e., only partial maps or, equivalently, only subgraphs of the ITS graphs, are known. Here, we investigate whether and how, and to what extent, such partial chemical data can be completed and compared. The focus of this contribution is entirely on the development of a solid mathematical foundation for the analysis of partial AAMs and their associated partial ITS graphs.

27 January 2016 in Algorithms
Verified
Journal Article
Open access
PDF file
TGThomas Gatter
Thomas Gatter
CSCédric Saule
Cédric Saule
RGRobert Giegerich
Robert Giegerich
Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when scoring schemes A and B can correctly evaluate the search space via dynamic programming, then so can Pareto optimization with respect to A and B. However, the integration of Pareto optimization into dynamic programming opens a wide range of algorithmic alternatives, which we study in substantial detail in this article, using real-world applications in biosequence analysis, a field where dynamic programming is ubiquitous. Our results are two-fold: (1) We introduce the operation of a “Pareto algebra product” in the dynamic programming framework of Bellman’s GAP. Users of this framework can now ask for Pareto optimization with a single keystroke. Careful evaluation of the implementation alternatives by means of an extended Bellman’s GAP compiler demonstrates the dependence of the best implementation choice on the application at hand. (2) We extract from our experiments several pieces of advice to programmers who do not use a system such as Bellman’s GAP, but who choose to hand-craft their dynamic programming recurrences, incorporating Pareto optimization from scratch.

1 June 2021 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
TGThomas Gatter
Thomas Gatter
SLSarah von Löhneysen
Sarah von Löhneysen
JFJörg Fallmann
Jörg Fallmann
PDPolina Drozdova
Polina Drozdova
THTom Hartmann
Tom Hartmann
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
Background: Advances in genome sequencing over the last years have lead to a fundamental paradigm shift in the field. With steadily decreasing sequencing costs, genome projects are no longer limited by the cost of raw sequencing data, but rather by computational problems associated with genome assembly. There is an urgent demand for more efficient and and more accurate methods is particular with regard to the highly complex and often very large genomes of animals and plants. Most recently, “hybrid” methods that integrate short and long read data have been devised to address this need. Results: is such a hybrid genome assembler. It has been designed specificially with an emphasis on utilizing low-coverage short and long reads. starts from a bipartite overlap graph between long reads and restrictively filtered short-read unitigs. This graph is translated into a long-read overlap graph G. Instead of the more conventional approach of removing tips, bubbles, and other local features, stepwisely extracts subgraphs whose global properties approach a disjoint union of paths. First, a consistently oriented subgraph is extracted, which in a second step is reduced to a directed acyclic graph. In the next step, properties of proper interval graphs are used to extract contigs as maximum weight paths. These path are translated into genomic sequences only in the final step. A prototype implementation of , entirely written in python, not only yields significantly more accurate assemblies of the yeast and fruit fly genomes compared to state-of-the-art pipelines but also requires much less computational effort. Conclusions: is new low-cost genome assembler that copes well with large genomes and low coverage. It is based on a novel approach for reducing the overlap graph to a collection of paths, thus opening new avenues for future improvements. Availability: The prototype is available at https://github.com/TGatter/LazyB.

13 July 2021 in Bioinformatics
Verified
Journal Article
Closed access
PDF file
TGThomas Gatter
Thomas Gatter
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
Accurate assembly of RNA-seq is a crucial step in many analytic tasks such as gene annotation or expression studies. Despite ongoing research, progress on traditional single sample assembly has brought no major breakthrough. Multi-sample RNA-Seq experiments provide more information than single sample datasets and thus constitute a promising area of research. Yet, this advantage is challenging to utilize due to the large amount of accumulating errors. We present an extension to Ryūtō enabling the reconstruction of consensus transcriptomes from multiple RNA-seq datasets, incorporating consensus calling at low level features. We report stable improvements already at three replicates. Ryūtō outperforms competing approaches, providing a better and user-adjustable sensitivity-precision trade-off. Ryūtō’s unique ability to utilize a (incomplete) reference for multi sample assemblies greatly increases precision. We demonstrate benefits for differential expression analysis. Ryūtō consistently improves assembly on replicates of the same tissue independent of filter settings, even when mixing conditions or time series. Consensus voting in Ryūtō is especially effective at high precision assembly, while Ryūtō’s conventional mode can reach higher recall. Ryūtō is available at https://github.com/studla/RYUTO. Supplementary data are available at Bioinformatics online.