Walter A. Kosters

Walter A. Kosters

Auto-generated profile, based on publicly available information

Walter A. Kosters

Computer Science, Leiden University, Leiden, The Netherlands

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
16 September 2022 in Nature Methods
Verified
Journal Article
Closed access
PDF file
JLJiadong Lin
Jiadong Lin
SWSongbo Wang
Songbo Wang
PAPeter A. Audano
Peter A. Audano
DMDeyu Meng
Deyu Meng
JFJacob I. Flores
Jacob I. Flores
KYKai Ye
Kai Ye

4 February 2023 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
APAske Plaat
Aske Plaat
WKWalter Kosters
Walter Kosters
MPMike Preuss
Mike Preuss

19 January 2007 in Bioinformatics
Verified
Journal Article
Open access
PDF file
KYKai Ye
Kai Ye
WKWalter A. Kosters
Walter A. Kosters
AIAdriaan P. Ijzerman
Adriaan P. Ijzerman
Motivation: Pattern discovery in protein sequences is often based on multiple sequence alignments (MSA). The procedure can be computationally intensive and often requires manual adjustment, which may be particularly difficult for a set of deviating sequences. In contrast, two algorithms, PRATT2 (http//www.ebi.ac.uk/pratt/) and TEIRESIAS (http://cbcsrv.watson.ibm.com/) are used to directly identify frequent patterns from unaligned biological sequences without an attempt to align them. Here we propose a new algorithm with more efficiency and more functionality than both PRATT2 and TEIRESIAS, and discuss some of its applications to G protein-coupled receptors, a protein family of important drug targets. Results: In this study, we designed and implemented six algorithms to mine three different pattern types from either one or two datasets using a pattern growth approach. We compared our approach to PRATT2 and TEIRESIAS in efficiency, completeness and the diversity of pattern types. Compared to PRATT2, our approach is faster, capable of processing large datasets and able to identify the so-called type III patterns. Our approach is comparable to TEIRESIAS in the discovery of the so-called type I patterns but has additional functionality such as mining the so-called type II and type III patterns and finding discriminating patterns between two datasets. Availability: The source code for pattern growth algorithms and their pseudo-code are available at http://www.liacs.nl/home/kosters/pg/ Contact:k.ye@lacdr.leidenuniv.nl

3 July 2021 in Genomics, Proteomics & Bioinformatics
Verified
Journal Article
Open access
JLJiadong Lin
Jiadong Lin
XYXiaofei Yang
Xiaofei Yang
WKWalter Kosters
Walter Kosters
TXTun Xu
Tun Xu
YJYanyan Jia
Yanyan Jia
KYKai Ye
Kai Ye
Complex structural variants (CSVs) are genomic alterations that have more than two breakpoints and are considered as the simultaneous occurrence of simple structural variants. However, detecting the compounded mutational signals of CSVs is challenging through a commonly used model-match strategy. As a result, there has been limited progress for CSV discovery compared with simple structural variants. Here, we systematically analyzed the multi-breakpoint connection feature of CSVs, and proposed Mako, utilizing a bottom-up guided model-free strategy, to detect CSVs from paired-end short-read sequencing. Specifically, we implemented a graph-based pattern growth approach, where the graph depicts potential breakpoint connections, and pattern growth enables CSV detection without pre-defined models. Comprehensive evaluations on both simulated and real datasets revealed that Mako outperformed other algorithms. Notably, validation rates of CSVs on real data based on experimental and computational validations as well as manual inspections are around 70%, where the medians of experimental and computational breakpoint shift are 13 bp and 26 bp, respectively. Moreover, the Mako CSV subgraph effectively characterized the breakpoint connections of a CSV event and uncovered a total of 15 CSV types, including two novel types of adjacent segment swap and tandem dispersed duplication. Further analysis of these CSVs also revealed the impact of sequence homology on the formation of CSVs. Mako is publicly available at https://github.com/xjtu-omics/Mako.

1 January 2023 in Bioinformatics
Verified
Journal Article
Open access
PDF file
JVJonathan K Vis
Jonathan K Vis
MSMark A Santcroos
Mark A Santcroos
WKWalter A Kosters
Walter A Kosters
JLJeroen F J Laros
Jeroen F J Laros
Beyond identifying genetic variants, we introduce a set of Boolean relations that allows for a comprehensive classification of the relations for every pair of variants by taking all minimal alignments into account. We present an efficient algorithm to compute these relations, including a novel way of efficiently computing all minimal alignments within the best theoretical complexity bounds. We show that for variants of the CFTR gene in dbSNP these relations are common and many non-trivial. Ultimately, we present an approach for the storing and indexing of variants in the context of a database that enables efficient querying for all these relations. A Python implementation is available at https://github.com/mutalyzer/algebra/tree/v0.2.0 as well as an interface at https://mutalyzer.nl/algebra.

2 March 2021 in bioRxiv
Verified
Preprint
Open access
PDF file
JLJiadong Lin
Jiadong Lin
XYXiaofei Yang
Xiaofei Yang
WKWalter Kosters
Walter Kosters
TXTun Xu
Tun Xu
YJYanyan Jia
Yanyan Jia
KYKai Ye
Kai Ye
Complex structural variants (CSVs) are genomic alterations that have more than two breakpoints and are considered as simultaneous occurrence of simple structural variants. However, detecting the compounded mutational signals of CSVs is challenging through a commonly used model-match strategy. As a result, there has been limited progress for CSV discovery compared with simple structural variants. We systematically analyzed the multi-breakpoint connection feature of CSVs, and proposed Mako, utilizing a bottom-up guided model-free strategy, to detect CSVs from paired-end short-read sequencing. Specifically, we implemented a graph-based pattern growth approach, where the graph depicts potential breakpoint connections and pattern growth enables CSV detection without predefined models. Comprehensive evaluations on both simulated and real datasets revealed that Mako outperformed other algorithms. Notably, validation rates of CSV on real data based on experimental and computational validations as well as manual inspections are around 70%, where the medians of experimental and computational breakpoint shift are 13bp and 26bp, respectively. Moreover, Mako CSV subgraph effectively characterized the breakpoint connections of a CSV event and uncovered a total of 15 CSV types, including two novel types of adjacent segments swap and tandem dispersed duplication. Further analysis of these CSVs also revealed impact of sequence homology in the formation of CSVs. Mako is publicly available at https://github.com/jiadong324/Mako .