Andre Leier

Dr. Andre Leier

orcid

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
8 March 2018 in Bioinformatics
Verified
Journal Article
Closed access
ZCZhen Chen
Zhen Chen
PZPei Zhao
Pei Zhao
FLFuyi Li
Fuyi Li
ALAndre Leier
Andre Leier
TMTatiana T Marquez-Lago
Tatiana T Marquez-Lago
Jiangning SongJiangning Song
Jiangning Song
Summary: Structural and physiochemical descriptors extracted from sequence data have been widely used to represent sequences and predict structural, functional, expression and interaction profiles of proteins and peptides as well as DNAs/RNAs. Here, we present iFeature, a versatile Python-based toolkit for generating various numerical feature representation schemes for both protein and peptide sequences. iFeature is capable of calculating and extracting a comprehensive spectrum of 18 major sequence encoding schemes that encompass 53 different types of feature descriptors. It also allows users to extract specific amino acid properties from the AAindex database. Furthermore, iFeature integrates 12 different types of commonly used feature clustering, selection and dimensionality reduction algorithms, greatly facilitating training, analysis and benchmarking of machine-learning models. The functionality of iFeature is made freely available via an online web server and a stand-alone toolkit. Availability and implementation: http://iFeature.erc.monash.edu/; https://github.com/Superzchen/iFeature/. Supplementary information: Supplementary data are available at Bioinformatics online.

24 April 2019 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
ZCZhen Chen
Zhen Chen
PZPei Zhao
Pei Zhao
FLFuyi Li
Fuyi Li
TMTatiana T Marquez-Lago
Tatiana T Marquez-Lago
ALAndre Leier
Andre Leier
Jiangning SongJiangning Song
Jiangning Song
With the explosive growth of biological sequences generated in the post-genomic era, one of the most challenging problems in bioinformatics and computational biology is to computationally characterize sequences, structures and functions in an efficient, accurate and high-throughput manner. A number of online web servers and stand-alone tools have been developed to address this to date; however, all these tools have their limitations and drawbacks in terms of their effectiveness, user-friendliness and capacity. Here, we present iLearn, a comprehensive and versatile Python-based toolkit, integrating the functionality of feature extraction, clustering, normalization, selection, dimensionality reduction, predictor construction, best descriptor/model selection, ensemble learning and results visualization for DNA, RNA and protein sequences. iLearn was designed for users that only want to upload their data set and select the functions they need calculated from it, while all necessary procedures and optimal settings are completed automatically by the software. iLearn includes a variety of descriptors for DNA, RNA and proteins, and four feature output formats are supported so as to facilitate direct output usage or communication with other computational tools. In total, iLearn encompasses 16 different types of feature clustering, selection, normalization and dimensionality reduction algorithms, and five commonly used machine-learning algorithms, thereby greatly facilitating feature analysis and predictor construction. iLearn is made freely available via an online web server and a stand-alone toolkit.

8 September 2006 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
MBManuel Barrio
Manuel Barrio
KBKevin Burrage
Kevin Burrage
ALAndre Leier
Andre Leier
Tianhai TianTianhai Tian
Tianhai Tian
Discrete stochastic simulations are a powerful tool for understanding the dynamics of chemical kinetics when there are small-to-moderate numbers of certain molecular species. In this paper we introduce delays into the stochastic simulation algorithm, thus mimicking delays associated with transcription and translation. We then show that this process may well explain more faithfully than continuous deterministic models the observed sustained oscillations in expression levels of hes1 mRNA and Hes1 protein. Delay processes are ubiquitous in the biological sciences but are not always well-represented in mathematical models attempting to describe these biological processes. Additional issues arise when attempting to capture the uncertainty (intrinsic noise) associated with chemical kinetics in dealing with when and in what order reactions take place. Complicating the situation further are important instances when certain key molecules occur only in small numbers, so that it is not meaningful to talk about concentrations. In this paper Barrio et al. show how to incorporate delay, intrinsic noise, and discreteness associated with chemical kinetic systems into a very simple algorithm called the delay stochastic simulation algorithm (DSSA). This algorithm very naturally generalises the stochastic simulation algorithm that does not treat delays. The authors then apply the DSSA to a specific set of experiments performed by Hirata et al. who showed, amongst other things, that serum treatment of cultured cells induces cyclic expression of both mRNA and protein of the Notch effector Hes1 with a two-hour period. The authors show how this approach can explain additional experiments performed by Hirata et al., and, because this approach is very general, suggest that it can provide deep insights into the relationship between delayed processes, intrinsic noise, and small numbers of molecules in many biological systems.

1 June 2000 in BioSystems
Verified
Journal Article
Closed access
ALAndre Leier
Andre Leier
CRChristoph Richter
Christoph Richter
WBWolfgang Banzhaf
Wolfgang Banzhaf
HRHilmar Rauhe
Hilmar Rauhe

10 May 2017 in Bioinformatics
Verified
Journal Article
Open access
PDF file
JWJiawei Wang
Jiawei Wang
BYBingjiao Yang
Bingjiao Yang
JRJerico Revote
Jerico Revote
ALAndre Leier
Andre Leier
TMTatiana T Marquez-Lago
Tatiana T Marquez-Lago
TLTrevor Lithgow
Trevor Lithgow
Evolutionary information in the form of a Position-Specific Scoring Matrix (PSSM) is a widely used and highly informative representation of protein sequences. Accordingly, PSSM-based feature descriptors have been successfully applied to improve the performance of various predictors of protein attributes. Even though a number of algorithms have been proposed in previous studies, there is currently no universal web server or toolkit available for generating this wide variety of descriptors. Here, we present POSSUM (Position-Specific Scoring matrix-based feature generator for machine learning), a versatile toolkit with an online web server that can generate 21 types of PSSM-based feature descriptors, thereby addressing a crucial need for bioinformaticians and computational biologists. We envisage that this comprehensive toolkit will be widely used as a powerful tool to facilitate feature extraction, selection, and benchmarking of machine learning-based models, thereby contributing to a more effective analysis and modeling pipeline for bioinformatics research. http://possum.erc.monash.edu/. Supplementary data are available at Bioinformatics online.

15 July 2020 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
SMShutao Mei
Shutao Mei
FLFuyi Li
Fuyi Li
ALAndre Leier
Andre Leier
TMTatiana Marquez-Lago
Tatiana Marquez-Lago
KGKailin Giam
Kailin Giam
Jiangning SongJiangning Song
Jiangning Song
Human leukocyte antigen class I (HLA-I) molecules are encoded by major histocompatibility complex (MHC) class I loci in humans. The binding and interaction between HLA-I molecules and intracellular peptides derived from a variety of proteolytic mechanisms play a crucial role in subsequent T-cell recognition of target cells and the specificity of the immune response. In this context, tools that predict the likelihood for a peptide to bind to specific HLA class I allotypes are important for selecting the most promising antigenic targets for immunotherapy. In this article, we comprehensively review a variety of currently available tools for predicting the binding of peptides to a selection of HLA-I allomorphs. Specifically, we compare their calculation methods for the prediction score, employed algorithms, evaluation strategies and software functionalities. In addition, we have evaluated the prediction performance of the reviewed tools based on an independent validation data set, containing 21 101 experimentally verified ligands across 19 HLA-I allotypes. The benchmarking results show that MixMHCpred 2.0.1 achieves the best performance for predicting peptides binding to most of the HLA-I allomorphs studied, while NetMHCpan 4.0 and NetMHCcons 1.1 outperform the other machine learning-based and consensus-based tools, respectively. Importantly, it should be noted that a peptide predicted with a higher binding score for a specific HLA allotype does not necessarily imply it will be immunogenic. That said, peptide-binding predictors are still very useful in that they can help to significantly reduce the large number of epitope candidates that need to be experimentally verified. Several other factors, including susceptibility to proteasome cleavage, peptide transport into the endoplasmic reticulum and T-cell receptor repertoire, also contribute to the immunogenicity of peptide antigens, and some of them can be considered by some predictors. Therefore, integrating features derived from these additional factors together with HLA-binding properties by using machine-learning algorithms may increase the prediction accuracy of immunogenic peptides. As such, we anticipate that this review and benchmarking survey will assist researchers in selecting appropriate prediction tools that best suit their purposes and provide useful guidelines for the development of improved antigen predictors in the future.