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

Timo Lassmann

dblp:82/4636 · DBLP profile ↗
← Back
12ranked-venue papers
8as first author
2since 2021 · last 2025
0000-0002-0138-2691ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 12 · 8 first-author · 2 since 2021

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
6 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
sequencing data analysis
0.932023
SAMStat 2: quality control for next generation sequencing data · Bioinform. 2023
SAMStat: monitoring biases in next generation sequencing data · Bioinform. 2011
TagDust - a program to eliminate artifacts from next generation sequencing data · Bioinform. 2009
Bioinformatics and computational biology › sequence analysis › sequencing data processing
sequencing quality control
0.822023
SAMStat 2: quality control for next generation sequencing data · Bioinform. 2023
SAMStat: monitoring biases in next generation sequencing data · Bioinform. 2011
Bioinformatics and computational biology › sequence analysis › read mapping
read mapping quality assessment
0.712023
SAMStat 2: quality control for next generation sequencing data · Bioinform. 2023
Bioinformatics and computational biology › multiple sequence alignment
guide tree construction
0.412020
Kalign 3: multiple sequence alignment of large datasets · Bioinform. 2020
Bioinformatics and computational biology
multiple sequence alignment
0.412020
Kalign 3: multiple sequence alignment of large datasets · Bioinform. 2020
Bioinformatics and computational biology
sequence alignment
0.412020
Kalign 3: multiple sequence alignment of large datasets · Bioinform. 2020
Bioinformatics and computational biology › gene regulation
gene regulation analysis
0.212016
CAGEd-oPOSSUM: motif enrichment analysis from CAGE-derived TSSs · Bioinform. 2016
Bioinformatics and computational biology › gene regulation › transcription factor analysis
transcription factor binding site enrichment
0.212016
CAGEd-oPOSSUM: motif enrichment analysis from CAGE-derived TSSs · Bioinform. 2016
Bioinformatics and computational biology
transcriptomics
0.112016
CAGEd-oPOSSUM: motif enrichment analysis from CAGE-derived TSSs · Bioinform. 2016

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

transformer-based language model · 0.9embedding-based retrieval · 0.9sequence embedding · 0.4bit-parallel gene myers algorithm · 0.4bisecting k-means · 0.4SIMD · 0.4motif enrichment analysis · 0.2false discovery rate control · 0.1
YearPublicationVenuePosition
2025 SampleExplorer: using language models to discover relevant transcriptome data
abstract
MOTIVATION: Over the last two decades, transcriptomics has become a standard technique in biomedical research. We now have large databases of RNA-seq data, accompanied by valuable metadata detailing scientific objectives and the experimental procedures used. The metadata is crucial in understanding and replicating published studies, but so far has been underutilized in helping researchers to discover existing datasets. RESULTS: We present SampleExplorer, a tool allowing researchers to search for relevant data using both text and gene set queries. SampleExplorer embeds sample metadata and uses a transformer-based language model to retrieve similar datasets. Extensive benchmarking (see Supplementary Materials and Methods) using the ARCHS4 database demonstrates that SampleExplorer provides an effective approach for retrieving biologically relevant samples from large-scale transcriptomicdata. This tool provides an efficient approach for discovering relevant gene expression datasets in large public repositories. It improves sample and dataset identification across diverse experimental contexts, helping researchers leverage existing transcriptomic data for potential replication or verification studies. Availability and implementation: SampleExplorer is available as a Python package compatible with versions 3.9 to 3.11, available for installation via the Python Package Index (PyPI). The codebase and documentation are accessible at https://github.com/wlchin/SampleExplorer. Supplementary data (Supplementary Materials and Methods) provides detailed methodological information, including an algorithmic description of the retrieval process and data preparation steps.
Wee Loong Chin, Timo Lassmann
Bioinform.2
2023 SAMStat 2: quality control for next generation sequencing data
abstract
MOTIVATION: SAMStat is an efficient program to extract quality control metrics from fastq and SAM/BAM files. A distinguishing feature is that it displays sequence composition, base quality composition and mapping error profiles split by mapping quality. This allows users to rapidly identify reasons for poor mapping including the presence of untrimmed adapters or poor sequencing quality at individual read positions. RESULTS: Here, we present a major update to SAMStat. The new version now supports paired-end and long-read data. Quality control plots are drawn using the ploty javascript library. AVAILABILITY AND IMPLEMENTATION: The source code of SAMStat and code to reproduce the results are found here: https://github.com/timolassmann/samstat.
Timo Lassmann
Bioinform.1
2020 Kalign 3: multiple sequence alignment of large datasets
abstract
MOTIVATION: Kalign is an efficient multiple sequence alignment (MSA) program capable of aligning thousands of protein or nucleotide sequences. However, current alignment problems involving large numbers of sequences are exceeding Kalign's original design specifications. Here we present a completely re-written and updated version to meet current and future alignment challenges. RESULTS: Kalign now uses a SIMD accelerated version of the bit-parallel Gene Myers algorithm to estimate pariwise distances, adopts a sequence embedding strategy and the bi-secting K-means algorithm to rapidly construct guide trees for thousands of sequences. The new version maintains high alignment accuracy on both protein and nucleotide alignments and scales better than other MSA tools. AVAILABILITY: The source code of Kalign and code to reproduce the results are found here: https://github.com/timolassmann/kalign.
Timo Lassmann
Bioinform.1
2018 Shared activity patterns arising at genetic susceptibility loci reveal underlying genomic and cellular architecture of human disease
abstract
Genetic variants underlying complex traits, including disease susceptibility, are enriched within the transcriptional regulatory elements, promoters and enhancers. There is emerging evidence that regulatory elements associated with particular traits or diseases share similar patterns of transcriptional activity. Accordingly, shared transcriptional activity (coexpression) may help prioritise loci associated with a given trait, and help to identify underlying biological processes. Using cap analysis of gene expression (CAGE) profiles of promoter- and enhancer-derived RNAs across 1824 human samples, we have analysed coexpression of RNAs originating from trait-associated regulatory regions using a novel quantitative method (network density analysis; NDA). For most traits studied, phenotype-associated variants in regulatory regions were linked to tightly-coexpressed networks that are likely to share important functional characteristics. Coexpression provides a new signal, independent of phenotype association, to enable fine mapping of causative variants. The NDA coexpression approach identifies new genetic variants associated with specific traits, including an association between the regulation of the OCT1 cation transporter and genetic variants underlying circulating cholesterol levels. NDA strongly implicates particular cell types and tissues in disease pathogenesis. For example, distinct groupings of disease-associated regulatory regions implicate two distinct biological processes in the pathogenesis of ulcerative colitis; a further two separate processes are implicated in Crohn's disease. Thus, our functional analysis of genetic predisposition to disease defines new distinct disease endotypes. We predict that patients with a preponderance of susceptibility variants in each group are likely to respond differently to pharmacological therapy. Together, these findings enable a deeper biological understanding of the causal basis of complex traits.
J. Kenneth Baillie, Andrew Bretherick, Chris S. Haley, Sara Clohisey, Alan Gray, Lucile P. A. Neyton, Jeffrey Barrett, Eli A. Stahl, Albert Tenesa, Robin Andersson, J. Ben Brown, Geoffrey J. Faulkner, Marina Lizio, Ulf Schaefer, Carsten O. Daub, Masayoshi Itoh, Naoto Kondo, Timo Lassmann, Jun Kawai, Damian Mole, Vladimir B. Bajic, Peter Heutink, Michael Rehli, Hideya Kawaji, Albin Sandelin, Harukazu Suzuki, Jack Satsangi, Christine A. Wells, Nir Hacohen, Tom C. Freeman, Yoshihide Hayashizaki, Piero Carninci, Alistair R. R. Forrest, David A. Hume
PLoS Comput. Biol.18
2016 CAGEd-oPOSSUM: motif enrichment analysis from CAGE-derived TSSs
abstract
UNLABELLED: With the emergence of large-scale Cap Analysis of Gene Expression (CAGE) datasets from individual labs and the FANTOM consortium, one can now analyze the cis-regulatory regions associated with gene transcription at an unprecedented level of refinement. By coupling transcription factor binding site (TFBS) enrichment analysis with CAGE-derived genomic regions, CAGEd-oPOSSUM can identify TFs that act as key regulators of genes involved in specific mammalian cell and tissue types. The webtool allows for the analysis of CAGE-derived transcription start sites (TSSs) either provided by the user or selected from ∼1300 mammalian samples from the FANTOM5 project with pre-computed TFBS predicted with JASPAR TF binding profiles. The tool helps power insights into the regulation of genes through the study of the specific usage of TSSs within specific cell types and/or under specific conditions. AVAILABILITY AND IMPLEMENTATION: The CAGEd-oPOSUM web tool is implemented in Perl, MySQL and Apache and is available at http://cagedop.cmmt.ubc.ca/CAGEd_oPOSSUM CONTACTS: [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
David J. Arenillas, Alistair R. R. Forrest, Hideya Kawaji, Timo Lassmann, Wyeth W. Wasserman, Anthony Mathelier
Bioinform.4
2015 TagDust2: a generic method to extract reads from sequencing data
abstract
BACKGROUND: Arguably the most basic step in the analysis of next generation sequencing data (NGS) involves the extraction of mappable reads from the raw reads produced by sequencing instruments. The presence of barcodes, adaptors and artifacts subject to sequencing errors makes this step non-trivial. RESULTS: Here I present TagDust2, a generic approach utilizing a library of hidden Markov models (HMM) to accurately extract reads from a wide array of possible read architectures. TagDust2 extracts more reads of higher quality compared to other approaches. Processing of multiplexed single, paired end and libraries containing unique molecular identifiers is fully supported. Two additional post processing steps are included to exclude known contaminants and filter out low complexity sequences. Finally, TagDust2 can automatically detect the library type of sequenced data from a predefined selection. CONCLUSION: Taken together TagDust2 is a feature rich, flexible and adaptive solution to go from raw to mappable NGS reads in a single step. The ability to recognize and record the contents of raw reads will help to automate and demystify the initial, and often poorly documented, steps in NGS data analysis pipelines. TagDust2 is freely available at: http://tagdust.sourceforge.net .
Timo Lassmann
BMC Bioinform.1
2015 Transcriptional Dynamics Reveal Critical Roles for Non-coding RNAs in the Immediate-Early Response
abstract
The immediate-early response mediates cell fate in response to a variety of extracellular stimuli and is dysregulated in many cancers. However, the specificity of the response across stimuli and cell types, and the roles of non-coding RNAs are not well understood. Using a large collection of densely-sampled time series expression data we have examined the induction of the immediate-early response in unparalleled detail, across cell types and stimuli. We exploit cap analysis of gene expression (CAGE) time series datasets to directly measure promoter activities over time. Using a novel analysis method for time series data we identify transcripts with expression patterns that closely resemble the dynamics of known immediate-early genes (IEGs) and this enables a comprehensive comparative study of these genes and their chromatin state. Surprisingly, these data suggest that the earliest transcriptional responses often involve promoters generating non-coding RNAs, many of which are produced in advance of canonical protein-coding IEGs. IEGs are known to be capable of induction without de novo protein synthesis. Consistent with this, we find that the response of both protein-coding and non-coding RNA IEGs can be explained by their transcriptionally poised, permissive chromatin state prior to stimulation. We also explore the function of non-coding RNAs in the attenuation of the immediate early response in a small RNA sequencing dataset matched to the CAGE data: We identify a novel set of microRNAs responsible for the attenuation of the IEG response in an estrogen receptor positive cancer cell line. Our computational statistical method is well suited to meta-analyses as there is no requirement for transcripts to pass thresholds for significant differential expression between time points, and it is agnostic to the number of time points per dataset.
Stuart Aitken, Shigeyuki Magi, Ahmad M. N. Alhendi, Masayoshi Itoh, Hideya Kawaji, Timo Lassmann, Carsten O. Daub, Erik Arner, Piero Carninci, Alistair R. R. Forrest, Yoshihide Hayashizaki, Levon M. Khachigian, Mariko Okada, C. A. M. Semple
PLoS Comput. Biol.6
2014 MOIRAI: A Compact Workflow System for CAGE Analysis
abstract
BACKGROUND: Cap analysis of gene expression (CAGE) is a sequencing based technology to capture the 5' ends of RNAs in a biological sample. After mapping, a CAGE peak on the genome indicates the position of an active transcriptional start site (TSS) and the number of reads correspond to its expression level. CAGE is prominently used in both the FANTOM and ENCODE project but presently there is no software package to perform the essential data processing steps. RESULTS: Here we describe MOIRAI, a compact yet flexible workflow system designed to carry out the main steps in data processing and analysis of CAGE data. MOIRAI has a graphical interface allowing wet-lab researchers to create, modify and run analysis workflows. Embedded within the workflows are graphical quality control indicators allowing users assess data quality and to quickly spot potential problems. We will describe three main workflows allowing users to map, annotate and perform an expression analysis over multiple samples. CONCLUSIONS: Due to the many built in quality control features MOIRAI is especially suitable to support the development of new sequencing based protocols. AVAILIABILITY: The MOIRAI source code is freely available at http://sourceforge.net/projects/moirai/.
Timo Lassmann, Akira Hasegawa, Carsten O. Daub, Piero Carninci, Yoshihide Hayashizaki
BMC Bioinform.1
2011 SAMStat: monitoring biases in next generation sequencing data
abstract
MOTIVATION: The sequence alignment/map format (SAM) is a commonly used format to store the alignments between millions of short reads and a reference genome. Often certain positions within the reads are inherently more likely to contain errors due to the protocols used to prepare the samples. Such biases can have adverse effects on both mapping rate and accuracy. To understand the relationship between potential protocol biases and poor mapping we wrote SAMstat, a simple C program plotting nucleotide overrepresentation and other statistics in mapped and unmapped reads in a concise html page. Collecting such statistics also makes it easy to highlight problems in the data processing and enables non-experts to track data quality over time. RESULTS: We demonstrate that studying sequence features in mapped data can be used to identify biases particular to one sequencing protocol. Once identified, such biases can be considered in the downstream analysis or even be removed by read trimming or filtering techniques. AVAILABILITY: SAMStat is open source and freely available as a C program running on all Unix-compatible platforms. The source code is available from http://samstat.sourceforge.net. CONTACT: [email protected].
Timo Lassmann, Yoshihide Hayashizaki, Carsten O. Daub
Bioinform.1
2009 TagDust - a program to eliminate artifacts from next generation sequencing data
abstract
MOTIVATION: Next-generation parallel sequencing technologies produce large quantities of short sequence reads. Due to experimental procedures various types of artifacts are commonly sequenced alongside the targeted RNA or DNA sequences. Identification of such artifacts is important during the development of novel sequencing assays and for the downstream analysis of the sequenced libraries. RESULTS: Here we present TagDust, a program identifying artifactual sequences in large sequencing runs. Given a user-defined cutoff for the false discovery rate, TagDust identifies all reads explainable by combinations and partial matches to known sequences used during library preparation. We demonstrate the quality of our method on sequencing runs performed on Illumina's Genome Analyzer platform. AVAILABILITY: Executables and documentation are available from http://genome.gsc.riken.jp/osc/english/software/. CONTACT: [email protected].
Timo Lassmann, Yoshihide Hayashizaki, Carsten O. Daub
Bioinform.1
2007 Automatic extraction of reliable regions from multiple sequence alignments
abstract
BACKGROUND: High quality multiple alignments are crucial in the transfer of annotation from one genome to another. Multiple alignment methods strive to achieve ever increasing levels of average accuracy on benchmark sets while the accuracy of individual alignments is often overlooked. RESULTS: We have previously developed a method to automatically assess the accuracy and overall difficulty of multiple alignments. This was achieved by a per-residue comparison between alternate alignments of the same sequences. Here we present a key extension to this method, an algorithm to extract similarly aligned regions from several alignments and merge them into a new consensus alignment. CONCLUSION: We demonstrate that the fraction of correctly aligned residues within the resulting alignments is increased by 25-100 percent compared to the original input alignments, as only the most reliably aligned parts are considered.
Timo Lassmann, Erik L. L. Sonnhammer
BMC Bioinform.1
2005 Kalign - an accurate and fast multiple sequence alignment algorithm
abstract
BACKGROUND: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families for conserved motifs, phylogeny, structural properties, and to improve sensitivity in homology searching. The availability of complete genome sequences has increased the demands on multiple sequence alignment (MSA) programs. Current MSA methods suffer from being either too inaccurate or too computationally expensive to be applied effectively in large-scale comparative genomics. RESULTS: We developed Kalign, a method employing the Wu-Manber string-matching algorithm, to improve both the accuracy and speed of multiple sequence alignment. We compared the speed and accuracy of Kalign to other popular methods using Balibase, Prefab, and a new large test set. Kalign was as accurate as the best other methods on small alignments, but significantly more accurate when aligning large and distantly related sets of sequences. In our comparisons, Kalign was about 10 times faster than ClustalW and, depending on the alignment size, up to 50 times faster than popular iterative methods. CONCLUSION: Kalign is a fast and robust alignment method. It is especially well suited for the increasingly important task of aligning large numbers of sequences.
Timo Lassmann, Erik L. L. Sonnhammer
BMC Bioinform.1