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

Benoit Morel

dblp:21/777 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
3since 2021 · last 2024
0000-0001-6286-4419ORCID · reported

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

Applied, interdisciplinary, general and emerging computing · 7 · 3 first-author · 3 since 2021Security and privacy · 1 · 1 first-author

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 · 90% Computational science and engineering · 10%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
3.262024
AleRax: a tool for gene and species tree co-estimation and reconciliation under a probabilistic model of gene duplication, transfer, and loss · Bioinform. 2024
Asteroid: a new algorithm to infer species trees from gene trees under high proportions of missing data · Bioinform. 2023
NetRAX: accurate and fast maximum likelihood phylogenetic network inference · Bioinform. 2022
Bioinformatics and computational biology › phylogenetics
species tree estimation
1.422024
AleRax: a tool for gene and species tree co-estimation and reconciliation under a probabilistic model of gene duplication, transfer, and loss · Bioinform. 2024
Asteroid: a new algorithm to infer species trees from gene trees under high proportions of missing data · Bioinform. 2023
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
maximum likelihood estimation
1.332022
NetRAX: accurate and fast maximum likelihood phylogenetic network inference · Bioinform. 2022
ParGenes: a tool for massively parallel model selection and phylogenetic tree inference on thousands of genes · Bioinform. 2019
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference · Bioinform. 2019
Bioinformatics and computational biology › phylogenetics
gene tree reconciliation
1.222024
AleRax: a tool for gene and species tree co-estimation and reconciliation under a probabilistic model of gene duplication, transfer, and loss · Bioinform. 2024
Treerecs: an integrated phylogenetic tool, from sequences to reconciliations · Bioinform. 2020
Bioinformatics and computational biology › phylogenetics
phylogenetic inference
0.822019
ParGenes: a tool for massively parallel model selection and phylogenetic tree inference on thousands of genes · Bioinform. 2019
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference · Bioinform. 2019
Bioinformatics and computational biology › phylogenetics
incomplete lineage sorting
0.712023
Asteroid: a new algorithm to infer species trees from gene trees under high proportions of missing data · Bioinform. 2023
Computational science and engineering
missing data
0.712023
Asteroid: a new algorithm to infer species trees from gene trees under high proportions of missing data · Bioinform. 2023
Bioinformatics and computational biology › phylogenetics › phylogenetic network
phylogenetic network inference
0.612022
NetRAX: accurate and fast maximum likelihood phylogenetic network inference · Bioinform. 2022
Computational science and engineering
model selection
0.412019
ParGenes: a tool for massively parallel model selection and phylogenetic tree inference on thousands of genes · Bioinform. 2019
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
phylogenetic tree search
0.412019
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference · Bioinform. 2019
Parallel and multicore computing
parallel computing
0.112019
ParGenes: a tool for massively parallel model selection and phylogenetic tree inference on thousands of genes · Bioinform. 2019

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

maximum likelihood · 1.3probabilistic model · 0.8joint phylogenetic-reconciliation likelihood · 0.8bootstrapping · 0.8gene tree summary method · 0.7phylogenetic likelihood function · 0.6displayed trees · 0.6duplication-loss reconciliation · 0.4transfer bootstrap support · 0.4greedy tree search · 0.4
YearPublicationVenuePosition
2024 AleRax: a tool for gene and species tree co-estimation and reconciliation under a probabilistic model of gene duplication, transfer, and loss
abstract
MOTIVATION: Genomes are a rich source of information on the pattern and process of evolution across biological scales. How best to make use of that information is an active area of research in phylogenetics. Ideally, phylogenetic methods should not only model substitutions along gene trees, which explain differences between homologous gene sequences, but also the processes that generate the gene trees themselves along a shared species tree. To conduct accurate inferences, one needs to account for uncertainty at both levels, that is, in gene trees estimated from inherently short sequences and in their diverse evolutionary histories along a shared species tree. RESULTS: We present AleRax, a software that can infer reconciled gene trees together with a shared species tree using a simple, yet powerful, probabilistic model of gene duplication, transfer, and loss. A key feature of AleRax is its ability to account for uncertainty in the gene tree and its reconciliation by using an efficient approximation to calculate the joint phylogenetic-reconciliation likelihood and sample reconciled gene trees accordingly. Simulations and analyses of empirical data show that AleRax is one order of magnitude faster than competing gene tree inference tools while attaining the same accuracy. It is consistently more robust than species tree inference methods such as SpeciesRax and ASTRAL-Pro 2 under gene tree uncertainty. Finally, AleRax can process multiple gene families in parallel thereby allowing users to compare competing phylogenetic hypotheses and estimate model parameters, such as duplication, transfer, and loss probabilities for genome-scale datasets with hundreds of taxa. AVAILABILITY AND IMPLEMENTATION: GNU GPL at https://github.com/BenoitMorel/AleRax and data are made available at https://cme.h-its.org/exelixis/material/alerax_data.tar.gz.
Benoit Morel, Tom A. Williams, Alexandros Stamatakis, Gergely J. Szöllosi
Bioinform.1
2023 Asteroid: a new algorithm to infer species trees from gene trees under high proportions of missing data
abstract
MOTIVATION: Missing data and incomplete lineage sorting (ILS) are two major obstacles to accurate species tree inference. Gene tree summary methods such as ASTRAL and ASTRID have been developed to account for ILS. However, they can be severely affected by high levels of missing data. RESULTS: We present Asteroid, a novel algorithm that infers an unrooted species tree from a set of unrooted gene trees. We show on both empirical and simulated datasets that Asteroid is substantially more accurate than ASTRAL and ASTRID for very high proportions (>80%) of missing data. Asteroid is several orders of magnitude faster than ASTRAL for datasets that contain thousands of genes. It offers advanced features such as parallelization, support value computation and support for multi-copy and multifurcating gene trees. AVAILABILITY AND IMPLEMENTATION: Asteroid is freely available at https://github.com/BenoitMorel/Asteroid. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Benoit Morel, Tom A. Williams, Alexandros Stamatakis
Bioinform.1
2022 NetRAX: accurate and fast maximum likelihood phylogenetic network inference
abstract
MOTIVATION: Phylogenetic networks can represent non-treelike evolutionary scenarios. Current, actively developed approaches for phylogenetic network inference jointly account for non-treelike evolution and incomplete lineage sorting (ILS). Unfortunately, this induces a very high computational complexity and current tools can only analyze small datasets. RESULTS: We present NetRAX, a tool for maximum likelihood (ML) inference of phylogenetic networks in the absence of ILS. Our tool leverages state-of-the-art methods for efficiently computing the phylogenetic likelihood function on trees, and extends them to phylogenetic networks via the notion of 'displayed trees'. NetRAX can infer ML phylogenetic networks from partitioned multiple sequence alignments and returns the inferred networks in Extended Newick format. On simulated data, our results show a very low relative difference in Bayesian Information Criterion (BIC) score and a near-zero unrooted softwired cluster distance to the true, simulated networks. With NetRAX, a network inference on a partitioned alignment with 8000 sites, 30 taxa and 3 reticulations completes within a few minutes on a standard laptop. AVAILABILITY AND IMPLEMENTATION: Our implementation is available under the GNU General Public License v3.0 at https://github.com/lutteropp/NetRAX. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Sarah Lutteropp, Céline Scornavacca, Alexey M. Kozlov, Benoit Morel, Alexandros Stamatakis
Bioinform.4
2020 Treerecs: an integrated phylogenetic tool, from sequences to reconciliations
abstract
MOTIVATION: Gene and species tree reconciliation methods are used to interpret gene trees, root them and correct uncertainties that are due to scarcity of signal in multiple sequence alignments. So far, reconciliation tools have not been integrated in standard phylogenetic software and they either lack performance on certain functions, or usability for biologists. RESULTS: We present Treerecs, a phylogenetic software based on duplication-loss reconciliation. Treerecs is simple to install and to use. It is fast and versatile, has a graphic output, and can be used along with methods for phylogenetic inference on multiple alignments like PLL and Seaview. AVAILABILITY AND IMPLEMENTATION: Treerecs is open-source. Its source code (C++, AGPLv3) and manuals are available from https://project.inria.fr/treerecs/.
Nicolas Comte, Benoit Morel, Damir Hasic, Laurent Guéguen, Bastien Boussau, Vincent Daubin, Simon Penel, Céline Scornavacca, Manolo Gouy, Alexandros Stamatakis, Eric Tannier, David P. Parsons
Bioinform.2
2019 RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference
abstract
MOTIVATION: Phylogenies are important for fundamental biological research, but also have numerous applications in biotechnology, agriculture and medicine. Finding the optimal tree under the popular maximum likelihood (ML) criterion is known to be NP-hard. Thus, highly optimized and scalable codes are needed to analyze constantly growing empirical datasets. RESULTS: We present RAxML-NG, a from-scratch re-implementation of the established greedy tree search algorithm of RAxML/ExaML. RAxML-NG offers improved accuracy, flexibility, speed, scalability, and usability compared with RAxML/ExaML. On taxon-rich datasets, RAxML-NG typically finds higher-scoring trees than IQTree, an increasingly popular recent tool for ML-based phylogenetic inference (although IQ-Tree shows better stability). Finally, RAxML-NG introduces several new features, such as the detection of terraces in tree space and the recently introduced transfer bootstrap support metric. AVAILABILITY AND IMPLEMENTATION: The code is available under GNU GPL at https://github.com/amkozlov/raxml-ng. RAxML-NG web service (maintained by Vital-IT) is available at https://raxml-ng.vital-it.ch/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Alexey M. Kozlov, Diego Darriba, Tomás Flouri, Benoit Morel, Alexandros Stamatakis
Bioinform.4
2019 ParGenes: a tool for massively parallel model selection and phylogenetic tree inference on thousands of genes
abstract
MOTIVATION: Coalescent- and reconciliation-based methods are now widely used to infer species phylogenies from genomic data. They typically use per-gene phylogenies as input, which requires conducting multiple individual tree inferences on a large set of multiple sequence alignments (MSAs). At present, no easy-to-use parallel tool for this task exists. Ad hoc scripts for this purpose do not only induce additional implementation overhead, but can also lead to poor resource utilization and long times-to-solution. We present ParGenes, a tool for simultaneously determining the best-fit model and inferring maximum likelihood (ML) phylogenies on thousands of independent MSAs using supercomputers. RESULTS: ParGenes executes common phylogenetic pipeline steps such as model-testing, ML inference(s), bootstrapping and computation of branch support values via a single parallel program invocation. We evaluated ParGenes by inferring > 20 000 phylogenetic gene trees with bootstrap support values from Ensembl Compara and VectorBase alignments in 28 h on a cluster with 1024 nodes. AVAILABILITY AND IMPLEMENTATION: GNU GPL at https://github.com/BenoitMorel/ParGenes. SUPPLEMENTARY INFORMATION: Supplementary material is available at Bioinformatics online.
Benoit Morel, Alexey M. Kozlov, Alexandros Stamatakis
Bioinform.1
2008 Anomaly-based intrusion detection using distributed intelligent systems
abstract
Anomaly based intrusion detection suffers from the uncontrollability of the rate of false alarms (false positive). What one computer may not be able to accomplish (reliable detection of a new malware with small false positive) many networked intelligently may. This paper is a proof of concept of that idea based on simulation with real data analysis. It speculates on how such set-up could be made part of a large scale intelligent system.
Benoit Morel
CRiSIS1
1995 Limits of space-based remote sensing for methane source characterization
abstract
This analysis examines the ability of a space-based instrument to identify and quantify methane sources in the presence of temperature, humidity, and albedo uncertainty. Thus, the objective is to quantify in the context of the NASA Earth Observing System (EOS) the synergistic benefit of simultaneous observation of the Earth's surface with atmospheric attributes. The analysis is illustrative of the type of examination that should inform remote sensing policy and system configuration decisions. The retrieval technique considered is linear inversion of near-IR spectral signals. The anticipated range of methane mixing ratio enhancement due to sources at the Earth's surface is compared to the detection limit of the space-based instrument.>
Peter Ashcroft, Benoit Morel
IEEE Trans. Geosci. Remote. Sens.2