Lucian Ilie

Prof. Lucian Ilie

orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
28 January 2011 in Bioinformatics
Verified
Journal Article
Closed access
MDMatei David
Matei David
MDMisko Dzamba
Misko Dzamba
DLDan Lister
Dan Lister
LILucian Ilie
Lucian Ilie
MBMichael Brudno
Michael Brudno
Summary: We report on a major update (version 2) of the original SHort Read Mapping Program (SHRiMP). SHRiMP2 primarily targets mapping sensitivity, and is able to achieve high accuracy at a very reasonable speed. SHRiMP2 supports both letter space and color space (AB/SOLiD) reads, enables for direct alignment of paired reads and uses parallel computation to fully utilize multi-core architectures. Availability: SHRiMP2 executables and source code are freely available at: http://compbio.cs.toronto.edu/shrimp/. Contact: shrimp@cs.toronto.edu Supplementary information: Supplementary data are available at Bioinformatics online.

25 August 2020 in Bioinformatics
Verified
Journal Article
Closed access
YLYiwei Li
Yiwei Li
GGG Brian Golding
G Brian Golding
LILucian Ilie
Lucian Ilie
Motivation: Proteins usually perform their functions by interacting with other proteins, which is why accurately predicting protein–protein interaction (PPI) binding sites is a fundamental problem. Experimental methods are slow and expensive. Therefore, great efforts are being made towards increasing the performance of computational methods. Results: We propose DEep Learning Prediction of Highly probable protein Interaction sites (DELPHI), a new sequence-based deep learning suite for PPI-binding sites prediction. DELPHI has an ensemble structure which combines a CNN and a RNN component with fine tuning technique. Three novel features, HSP, position information and ProtVec are used in addition to nine existing ones. We comprehensively compare DELPHI to nine state-of-the-art programmes on five datasets, and DELPHI outperforms the competing methods in all metrics even though its training dataset shares the least similarities with the testing datasets. In the most important metrics, AUPRC and MCC, it surpasses the second best programmes by as much as 18.5% and 27.7%, respectively. We also demonstrated that the improvement is essentially due to using the ensemble model and, especially, the three new features. Using DELPHI it is shown that there is a strong correlation with protein-binding residues (PBRs) and sites with strong evolutionary conservation. In addition, DELPHI’s predicted PBR sites closely match known data from Pfam. DELPHI is available as open-sourced standalone software and web server. Availability and implementation: The DELPHI web server can be found at delphi.csd.uwo.ca/, with all datasets and results in this study. The trained models, the DELPHI standalone source code, and the feature computation pipeline are freely available at github.com/lucian-ilie/DELPHI. Supplementary information: Supplementary data are available at Bioinformatics online.

1 April 2008 in Information Processing Letters
Verified
Journal Article
Closed access
MCMaxime Crochemore
Maxime Crochemore
LILucian Ilie
Lucian Ilie

1 October 2003 in Information and Computation
Verified
Journal Article
Closed access
LILucian Ilie
Lucian Ilie
SYSheng Yu
Sheng Yu

26 November 2010 in Bioinformatics
Verified
Journal Article
Closed access
LILucian Ilie
Lucian Ilie
FFFarideh Fazayeli
Farideh Fazayeli
SISilvana Ilie
Silvana Ilie
Motivation: High-throughput sequencing technologies produce very large amounts of data and sequencing errors constitute one of the major problems in analyzing such data. Current algorithms for correcting these errors are not very accurate and do not automatically adapt to the given data. Results: We present HiTEC, an algorithm that provides a highly accurate, robust and fully automated method to correct reads produced by high-throughput sequencing methods. Our approach provides significantly higher accuracy than previous methods. It is time and space efficient and works very well for all read lengths, genome sizes and coverage levels. Availability: The source code of HiTEC is freely available at www.csd.uwo.ca/~ilie/HiTEC/. Contact: ilie@csd.uwo.ca

15 November 2017 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
YLYiwei Li
Yiwei Li
LILucian Ilie
Lucian Ilie
Proteins perform their functions usually by interacting with other proteins. Predicting which proteins interact is a fundamental problem. Experimental methods are slow, expensive, and have a high rate of error. Many computational methods have been proposed among which sequence-based ones are very promising. However, so far no such method is able to predict effectively the entire human interactome: they require too much time or memory. We present SPRINT (Scoring PRotein INTeractions), a new sequence-based algorithm and tool for predicting protein-protein interactions. We comprehensively compare SPRINT with state-of-the-art programs on seven most reliable human PPI datasets and show that it is more accurate while running orders of magnitude faster and using very little memory. SPRINT is the only sequence-based program that can effectively predict the entire human interactome: it requires between 15 and 100 min, depending on the dataset. Our goal is to transform the very challenging problem of predicting the entire human interactome into a routine task. The source code of SPRINT is freely available from https://github.com/lucian-ilie/SPRINT/ and the datasets and predicted PPIs from www.csd.uwo.ca/faculty/ilie/SPRINT/ .