Eric-Wubbo Lameijer

dblp:62/1664 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2016
0000-0002-0397-0710ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 2

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

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
high-throughput sequencing data analysis
0.212016
Detecting dispersed duplications in high-throughput sequencing data using a database-free approach · Bioinform. 2016
Bioinformatics and computational biology › genomics
sequencing
0.212016
Detecting dispersed duplications in high-throughput sequencing data using a database-free approach · Bioinform. 2016
Bioinformatics and computational biology › genomics › structural variation
structural variation detection
0.212016
Detecting dispersed duplications in high-throughput sequencing data using a database-free approach · Bioinform. 2016
Bioinformatics and computational biology › transcriptomics
RNA-seq analysis
0.112012
PASSion: a pattern growth algorithm-based pipeline for splice junction detection in paired-end RNA-Seq data · Bioinform. 2012
Bioinformatics and computational biology › transcriptomics › RNA splicing analysis
splice junction detection
0.112012
PASSion: a pattern growth algorithm-based pipeline for splice junction detection in paired-end RNA-Seq data · Bioinform. 2012
Bioinformatics and computational biology
transcriptomics
0.112012
PASSion: a pattern growth algorithm-based pipeline for splice junction detection in paired-end RNA-Seq data · Bioinform. 2012

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

paired-end read alignment · 0.2pattern growth algorithm · 0.1paired-end read mapping · 0.1
YearPublicationVenuePosition
2016 Detecting dispersed duplications in high-throughput sequencing data using a database-free approach
abstract
MOTIVATION: Dispersed duplications (DDs) such as transposon element insertions and copy number variations are ubiquitous in the human genome. They have attracted the interest of biologists as well as medical researchers due to their role in both evolution and disease. The efforts of discovering DDs in high-throughput sequencing data are currently dominated by database-oriented approaches that require pre-existing knowledge of the DD elements to be detected. RESULTS: We present DD_DETECTION, a database-free approach to finding DD events in high-throughput sequencing data. DD_DETECTION is able to detect DDs purely from paired-end read alignments. We show in a comparative study that this method is able to compete with database-oriented approaches in recovering validated transposon insertion events. We also experimentally validate the predictions of DD_DETECTION on a human DNA sample, showing that it can find not only duplicated elements present in common databases but also DDs of novel type. AVAILABILITY AND IMPLEMENTATION: The software presented in this article is open source and available from https://bitbucket.org/mkroon/dd_detection.
M. Kroon, Eric-Wubbo Lameijer, N. Lakenberg, Jayne Y. Hehir-Kwa, D. T. Thung, P. Eline Slagboom, Joost N. Kok, Kai Ye 0001
Bioinform.2
2012 PASSion: a pattern growth algorithm-based pipeline for splice junction detection in paired-end RNA-Seq data
abstract
MOTIVATION: RNA-seq is a powerful technology for the study of transcriptome profiles that uses deep-sequencing technologies. Moreover, it may be used for cellular phenotyping and help establishing the etiology of diseases characterized by abnormal splicing patterns. In RNA-Seq, the exact nature of splicing events is buried in the reads that span exon-exon boundaries. The accurate and efficient mapping of these reads to the reference genome is a major challenge. RESULTS: We developed PASSion, a pattern growth algorithm-based pipeline for splice site detection in paired-end RNA-Seq reads. Comparing the performance of PASSion to three existing RNA-Seq analysis pipelines, TopHat, MapSplice and HMMSplicer, revealed that PASSion is competitive with these packages. Moreover, the performance of PASSion is not affected by read length and coverage. It performs better than the other three approaches when detecting junctions in highly abundant transcripts. PASSion has the ability to detect junctions that do not have known splicing motifs, which cannot be found by the other tools. Of the two public RNA-Seq datasets, PASSion predicted ≈ 137,000 and 173,000 splicing events, of which on average 82 are known junctions annotated in the Ensembl transcript database and 18% are novel. In addition, our package can discover differential and shared splicing patterns among multiple samples. AVAILABILITY: The code and utilities can be freely downloaded from https://trac.nbic.nl/passion and ftp://ftp.sanger.ac.uk/pub/zn1/passion.
Yanju Zhang, Eric-Wubbo Lameijer, Peter A. C. 't Hoen, Zemin Ning, P. Eline Slagboom, Kai Ye 0001
Bioinform.2
2005 Using data mining to improve mutation in a tool for molecular evolution
abstract
We have developed an evolutionary algorithm-based program for drug design, the molecule evoluator. This program transforms known molecules into new molecules which may have improved properties relative to the parent molecule. Transforming the parent molecule into a derivative by mutation is necessary to find molecules with increased fitness. However, mutations that just randomly add and substitute atoms often result in molecules that contain undesirable chemical substructures, and can therefore not be used as drugs. We therefore want to add knowledge to the program about which mutations result in proper chemical structures and which ones do not. In this research we have mined a large chemical database, the World Drug Index, to obtain the frequencies of small substructures in drug-like molecules. Some of our mutation operators were subsequently modified to use these frequencies. Testing the new mutation frequencies on another large database of molecules, the NCI database, we found that the knowledge-based mutations more often produced existing molecules than the original mutations. This suggests that the modified mutations produce molecules that are easier to synthesize and more drug-like compared to the molecules generated using the original uninformed mutation operators.
Eric-Wubbo Lameijer, Adriaan P. IJzerman, Joost N. Kok
Congress on Evolutionary Computation1
2005 The molecule evoluator: an interactive evolutionary algorithm for designing drug molecules
abstract
To help chemists design new drugs, we created a tool that uses interactive evolution to design drug molecules, the "Molecule Evoluator". In contrast to most other evolutionary de novo design programs, the molecule representation and the set of mutations enable it to both search the chemical space of all drug like molecules extensively and to fine-tune molecular structures to the problem at hand. Additionally, we use interaction with the user as a fitness function, which is new in evolutionary algorithms in drug design. This interactivity allows the Molecule Evoluator to use the domain knowledge of the chemist to estimate the ease of synthesis and the biological activity of the compound. This knowledge can guide the optimization process and thereby improve its results. Chemists of our department using the Molecule Evoluator were able to find six novel and synthesizable druglike core structures, indicating that the Molecule Evoluator can be used as a tool to enhance the chemist's creativity.
Eric-Wubbo Lameijer, Adriaan P. IJzerman, Joost N. Kok
GECCO1
2005 Evolutionary Algorithms in Drug Design
Eric-Wubbo Lameijer, Thomas Bäck, Joost N. Kok, Adriaan P. IJzerman
Nat. Comput.1