Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sascha Ott

dblp:89/1443 · DBLP profile ↗
← Back
13ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-5411-8114ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 9 · 1 first-author · 2 since 2021Theory of computation · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
5 papers
Bioinformatics and computational biology · 100%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › gene regulation › gene regulatory network
gene regulatory network analysis
0.212014
Wigwams: identifying gene modules co-regulated across multiple biological conditions · Bioinform. 2014
Bioinformatics and computational biology
gene expression analysis
0.212013
MEME-LaB: motif analysis in clusters · Bioinform. 2013
Bioinformatics and computational biology › sequence analysis › motif discovery
motif analysis
0.212013
MEME-LaB: motif analysis in clusters · Bioinform. 2013
Bioinformatics and computational biology › gene regulation
transcription factor binding site prediction
0.212013
MEME-LaB: motif analysis in clusters · Bioinform. 2013
Bioinformatics and computational biology › gene regulation
regulatory sequence analysis
0.112010
An alignment-free model for comparison of regulatory sequences · Bioinform. 2010
Bioinformatics and computational biology › gene regulation › transcription factor binding site prediction
transcription factor binding site analysis
0.112010
An alignment-free model for comparison of regulatory sequences · Bioinform. 2010
Bioinformatics and computational biology › gene expression analysis
time series gene expression
0.112014
Wigwams: identifying gene modules co-regulated across multiple biological conditions · Bioinform. 2014
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.112005
Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution · Bioinform. 2005
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network topology analysis
network motif discovery
0.112005
Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution · Bioinform. 2005

Methods — techniques the papers use, named apart from their topics

web interface · 0.2ab initio motif finding · 0.2statistical significance testing · 0.1subgraph enumeration · 0.1microarray data analysis · 0.1
YearPublicationVenuePosition
2025 Integrative systems biology approaches for analyzing microbiome dysbiosis and species interactions
abstract
Microbiomes are crucial for human health and well-being, with microbial dysbiosis being linked to various complex diseases. Therefore, understanding the structural and functional changes in the microbiome, along with the underlying mechanisms in disease conditions, is essential. In this review, we outline the structure and function of different human microbiomes and examine how changes in their composition may contribute to diseases. We highlight critical information associated with microbial dysbiosis and explore various therapeutic strategies for restoring a healthy microbiome, including microbiota transplantation, phage therapy, probiotics, prebiotics, dietary interventions, and drug-based approaches. Further, to better understand microbiome dysbiosis, we discuss multi-omics approaches including metagenomics, metatranscriptomics, metaproteomics, and meta-metabolomics, alongside computational modeling approaches such as ecological and metabolic network analysis. We outline key challenges associated with multi-omics techniques and emphasize the importance of integrative systems biology approaches that combine multi-omics data with computational modeling. These approaches are crucial for effectively analyzing microbiome data, providing deeper insights into species interactions and microbiome dynamics. Finally, we offer insights into future research directions in the field of microbiome research. This review makes a unique contribution to microbiome research by presenting a holistic framework that integrates multi-omics data with multi-scale modeling to elucidate microbial interactions, microbiome dysbiosis, and their modulation in disease-associated contexts.
Syed Sabih Ur Rehman, Muhammad Ibtisam Nasar, Cristina S. Mesquita, Souhaila Al Khodor, Richard A. Notebaart, Sascha Ott, Sunil Mundra, Ramesh P. Arasardanam, Khalid Muhammad, Mohammad Tauqeer Alam
Briefings Bioinform.6
2024 TimeTeller: A tool to probe the circadian clock as a multigene dynamical system
abstract
Recent studies have established that the circadian clock influences onset, progression and therapeutic outcomes in a number of diseases including cancer and heart diseases. Therefore, there is a need for tools to measure the functional state of the molecular circadian clock and its downstream targets in patients. Moreover, the clock is a multi-dimensional stochastic oscillator and there are few tools for analysing it as a noisy multigene dynamical system. In this paper we consider the methodology behind TimeTeller, a machine learning tool that analyses the clock as a noisy multigene dynamical system and aims to estimate circadian clock function from a single transcriptome by modelling the multi-dimensional state of the clock. We demonstrate its potential for clock systems assessment by applying it to mouse, baboon and human microarray and RNA-seq data and show how to visualise and quantify the global structure of the clock, quantitatively stratify individual transcriptomic samples by clock dysfunction and globally compare clocks across individuals, conditions and tissues thus highlighting its potential relevance for advancing circadian medicine.
Denise Vlachou, Maria Veretennikova, Laura Usselmann, Vadim Vasilyev, Sascha Ott, Georg A. Bjarnason, Robert Dallmann, Francis Lévi, David A. Rand
PLoS Comput. Biol.5
2018 Bringing numerous methods for expression and promoter analysis to a public cloud computing service
abstract
Summary: Every year, a large number of novel algorithms are introduced to the scientific community for a myriad of applications, but using these across different research groups is often troublesome, due to suboptimal implementations and specific dependency requirements. This does not have to be the case, as public cloud computing services can easily house tractable implementations within self-contained dependency environments, making the methods easily accessible to a wider public. We have taken 14 popular methods, the majority related to expression data or promoter analysis, developed these up to a good implementation standard and housed the tools in isolated Docker containers which we integrated into the CyVerse Discovery Environment, making these easily usable for a wide community as part of the CyVerse UK project. Availability and implementation: The integrated apps can be found at http://www.cyverse.org/discovery-environment, while the raw code is available at https://github.com/cyversewarwick and the corresponding Docker images are housed at https://hub.docker.com/r/cyversewarwick/. Contact: [email protected] or [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.
Krzysztof Polanski, Bo Gao 0001, Sam A. Mason, Paul Brown, Sascha Ott, Katherine J. Denby, David L. Wild
Bioinform.5
2014 Wigwams: identifying gene modules co-regulated across multiple biological conditions
abstract
MOTIVATION: Identification of modules of co-regulated genes is a crucial first step towards dissecting the regulatory circuitry underlying biological processes. Co-regulated genes are likely to reveal themselves by showing tight co-expression, e.g. high correlation of expression profiles across multiple time series datasets. However, numbers of up- or downregulated genes are often large, making it difficult to discriminate between dependent co-expression resulting from co-regulation and independent co-expression. Furthermore, modules of co-regulated genes may only show tight co-expression across a subset of the time series, i.e. show condition-dependent regulation. RESULTS: Wigwams is a simple and efficient method to identify gene modules showing evidence for co-regulation in multiple time series of gene expression data. Wigwams analyzes similarities of gene expression patterns within each time series (condition) and directly tests the dependence or independence of these across different conditions. The expression pattern of each gene in each subset of conditions is tested statistically as a potential signature of a condition-dependent regulatory mechanism regulating multiple genes. Wigwams does not require particular time points and can process datasets that are on different time scales. Differential expression relative to control conditions can be taken into account. The output is succinct and non-redundant, enabling gene network reconstruction to be focused on those gene modules and combinations of conditions that show evidence for shared regulatory mechanisms. Wigwams was run using six Arabidopsis time series expression datasets, producing a set of biologically significant modules spanning different combinations of conditions. AVAILABILITY AND IMPLEMENTATION: A Matlab implementation of Wigwams, complete with graphical user interfaces and documentation, is available at: warwick.ac.uk/wigwams. .
Krzysztof Polanski, Johanna Rhodes, Claire Hill, Peijun Zhang, Dafyd J. Jenkins, Steven J. Kiddle, Aleksey Jironkin, Jim Beynon, Vicky Buchanan-Wollaston, Sascha Ott, Katherine J. Denby
Bioinform.10
2013 MEME-LaB: motif analysis in clusters
abstract
SUMMARY: Genome-wide expression analysis can result in large numbers of clusters of co-expressed genes. Although there are tools for ab initio discovery of transcription factor-binding sites, most do not provide a quick and easy way to study large numbers of clusters. To address this, we introduce a web tool called MEME-LaB. The tool wraps MEME (an ab initio motif finder), providing an interface for users to input multiple gene clusters, retrieve promoter sequences, run motif finding and then easily browse and condense the results, facilitating better interpretation of the results from large-scale datasets. AVAILABILITY: MEME-LaB is freely accessible at: http://wsbc.warwick.ac.uk/wsbcToolsWebpage/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Paul Brown, Laura Baxter, Richard Hickman, Jim Beynon, Jonathan D. Moore, Sascha Ott
Bioinform.6
2010 An alignment-free model for comparison of regulatory sequences
abstract
MOTIVATION: Some recent comparative studies have revealed that regulatory regions can retain function over large evolutionary distances, even though the DNA sequences are divergent and difficult to align. It is also known that such enhancers can drive very similar expression patterns. This poses a challenge for the in silico detection of biologically related sequences, as they can only be discovered using alignment-free methods. RESULTS: Here, we present a new computational framework called Regulatory Region Scoring (RRS) model for the detection of functional conservation of regulatory sequences using predicted occupancy levels of transcription factors of interest. We demonstrate that our model can detect the functional and/or evolutionary links between some non-alignable enhancers with a strong statistical significance. We also identify groups of enhancers that are likely to be similarly regulated. Our model is motivated by previous work on prediction of expression patterns and it can capture similarity by strong binding sites, weak binding sites and even the statistically significant absence of sites. Our results support the hypothesis that weak binding sites contribute to the functional similarity of sequences. Our model fills a gap between two families of models: detailed, data-intensive models for the prediction of precise spatio-temporal expression patterns on the one side, and crude, generally applicable models on the other side. Our model borrows some of the strengths of each group and addresses their drawbacks. AVAILABILITY: The RRS source code is freely available upon publication of this manuscript: http://www2.warwick.ac.uk/fac/sci/systemsbiology/staff/ott/tools_and_software/rrs.
Hashem Koohy, Nigel P. Dyer, John E. Reid, Georgy Koentges, Sascha Ott
Bioinform.5
2009 Transcriptional programs: Modelling higher order structure in transcriptional control
abstract
BACKGROUND: Transcriptional regulation is an important part of regulatory control in eukaryotes. Even if binding motifs for transcription factors are known, the task of finding binding sites by scanning sequences is plagued by false positives. One way to improve the detection of binding sites from motifs is by taking cooperativity of transcription factor binding into account. We propose a non-parametric probabilistic model, similar to a document topic model, for detecting transcriptional programs, groups of cooperative transcription factors and co-regulated genes. The analysis results in transcriptional programs which generalise both transcriptional modules and TF-target gene incidence matrices and provide a higher-level summary of these structures. The method is independent of prior specification of training sets of genes, for example, via gene expression data. The analysis is based on known binding motifs. RESULTS: We applied our method to putative regulatory regions of 18,445 Mus musculus genes. We discovered just 68 transcriptional programs that effectively summarised the action of 149 transcription factors on these genes. Several of these programs were significantly enriched for known biological processes and signalling pathways. One transcriptional program has a significant overlap with a reference set of cell cycle specific transcription factors. CONCLUSION: Our method is able to pick out higher order structure from noisy sequence analyses. The transcriptional programs it identifies potentially represent common mechanisms of regulatory control across the genome. It simultaneously predicts which genes are co-regulated and which sets of transcription factors cooperate to achieve this co-regulation. The programs we discovered enable biologists to choose new genes and transcription factors to study in specific transcriptional regulatory systems.
John E. Reid, Sascha Ott, Lorenz Wernisch
BMC Bioinform.2
2007 A comparative study of S/MAR prediction tools
abstract
BACKGROUND: S/MARs are regions of the DNA that are attached to the nuclear matrix. These regions are known to affect substantially the expression of genes. The computer prediction of S/MARs is a highly significant task which could contribute to our understanding of chromatin organisation in eukaryotic cells, the number and distribution of boundary elements, and the understanding of gene regulation in eukaryotic cells. However, while a number of S/MAR predictors have been proposed, their accuracy has so far not come under scrutiny. RESULTS: We have selected S/MARs with sufficient experimental evidence and used these to evaluate existing methods of S/MAR prediction. Our main results are: 1.) all existing methods have little predictive power, 2.) a simple rule based on AT-percentage is generally competitive with other methods, 3.) in practice, the different methods will usually identify different sub-sequences as S/MARs, 4.) more research on the H-Rule would be valuable. CONCLUSION: A new insight is needed to design a method which will predict S/MARs well. Our data, including the control data, has been deposited as additional material and this may help later researchers test new predictors.
Kenneth Evans, Sascha Ott, Annika Hansen, Georgy Koentges, Lorenz Wernisch
BMC Bioinform.2
2007 On the complexity of deriving position specific score matrices from positive and negative sequences
Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
Discret. Appl. Math.4
2005 Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution
abstract
MOTIVATION: Estimating the network of regulative interactions between genes from gene expression measurements is a major challenge. Recently, we have shown that for gene networks of up to around 35 genes, optimal network models can be computed. However, even optimal gene network models will in general contain false edges, since the expression data will not unambiguously point to a single network. RESULTS: In order to overcome this problem, we present a computational method to enumerate the most likely m networks and to extract a widely common subgraph (denoted as gene network motif) from these. We apply the method to bacterial gene expression data and extensively compare estimation results to knowledge. Our results reveal that gene network motifs are in significantly better agreement to biological knowledge than optimal network models. We also confirm this observation in a series of estimations using synthetic microarray data and compare estimations by our method with previous estimations for yeast. Furthermore, we use our method to estimate similarities and differences of the gene networks that regulate tryptophan metabolism in two related species and thereby demonstrate the analysis of gene network evolution. AVAILABILITY: Commercial license negotiable with Gene Networks Inc. ([email protected]) CONTACT: [email protected]
Sascha Ott, Annika Hansen, SunYong Kim, Satoru Miyano
Bioinform.1
2002 Inferring a Union of Halfspaces from Examples
Tatsuya Akutsu, Sascha Ott
COCOON2
2002 On the Complexity of Deriving Position Specific Score Matrices from Examples
Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
CPM4
1999 Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
Sascha Ott
WG1