Sarah Lutteropp

Sarah Lutteropp

Auto-generated profile, based on publicly available information

Sarah Lutteropp

Computational Molecular Evolution Group, Heidelberg Institute for Theoretical Studies , Heidelberg 69118, Germany

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
17 June 2022 in Bioinformatics
Verified
Journal Article
Open access
PDF file
SLSarah Lutteropp
Sarah Lutteropp
CSCéline Scornavacca
Céline Scornavacca
AKAlexey Kozlov
Alexey Kozlov
BMBenoit Morel
Benoit Morel
ASAlexandros Stamatakis
Alexandros Stamatakis
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. 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. Our implementation is available under the GNU General Public License v3.0 at https://github.com/lutteropp/NetRAX. Supplementary data are available at Bioinformatics online.

22 November 2019 in Bioinformatics
Verified
Journal Article
Open access
PDF file
SLSarah Lutteropp
Sarah Lutteropp
AKAlexey Kozlov
Alexey Kozlov
ASAlexandros Stamatakis
Alexandros Stamatakis
Recently, Lemoine et al. suggested the transfer bootstrap expectation (TBE) branch support metric as an alternative to classical phylogenetic bootstrap support for taxon-rich datasets. However, the original TBE implementation in the booster tool is compute- and memory-intensive. We developed a fast and memory-efficient TBE implementation. We improve upon the original algorithm by Lemoine et al. via several algorithmic and technical optimizations. On empirical as well as on random tree sets with varying taxon counts, our implementation is up to 480 times faster than booster. Furthermore, it only requires memory that is linear in the number of taxa, which leads to 10× to 40× memory savings compared with booster. Our implementation has been partially integrated into pll-modules and RAxML-NG and is available under the GNU Affero General Public License v3.0 at https://github.com/ddarriba/pll-modules and https://github.com/amkozlov/raxml-ng. The parallel version that also computes additional TBE-related statistics is available at: https://github.com/lutteropp/raxml-ng/tree/tbe. Supplementary data are available at Bioinformatics online.

14 July 2016 in bioRxiv
Verified
Preprint
Open access
PDF file
PKPaschalia Kapli
Paschalia Kapli
SLSarah Lutteropp
Sarah Lutteropp
JZJiajie Zhang
Jiajie Zhang
KKKassian Kobert
Kassian Kobert
PPPavlos Pavlidis
Pavlos Pavlidis
TFTomas Flouri
Tomas Flouri
Motivation: In recent years, molecular species delimitation has become a routine approach for quantifying and classifying biodiversity. Barcoding methods are of particular importance in large-scale surveys as they promote fast species discovery and biodiversity estimates. Among those, distance-based methods are the most common choice as they scale well with large datasets; however, they are sensitive to similarity threshold parameters and they ignore evolutionary relationships. The recently introduced “Poisson Tree Processes” (PTP) method is a phylogeny-aware approach that does not rely on such thresholds. Yet, two weaknesses of PTP impact its accuracy and practicality when applied to large datasets; it does not account for divergent intraspecific variation and is slow for a large number of sequences. Results: We introduce the multi-rate PTP (mPTP), an improved method that alleviates the theoretical and technical shortcomings of PTP. It incorporates different levels of intraspecific genetic diversity deriving from differences in either the evolutionary history or sampling of each species. Results on empirical data suggest that mPTP is superior to PTP and popular distance-based methods as it, consistently, yields more accurate delimitations with respect to the taxonomy (i.e., identifies more taxonomic species, infers species numbers closer to the taxonomy). Moreover, mPTP does not require any similarity threshold as input. The novel dynamic programming algorithm attains a speedup of at least five orders of magnitude compared to PTP, allowing it to delimit species in large (meta-) barcoding data. In addition, Markov Chain Monte Carlo sampling provides a comprehensive evaluation of the inferred delimitation in just a few seconds for millions of steps, independently of tree size. Availability: mPTP is implemented in C and is available for download at http://github.com/Pas-Kapli/mptp under the GNU Affero 3 license. A web-service is available at http://mptp.h-its.org . Contact: Paschalia.Kapli@h-its.org , Alexandros.Stamatakis@hits.org , Tomas.Flouri@h-its.org

27 July 2017 in bioRxiv
Verified
Preprint
Open access
PDF file
XZXiaofan Zhou
Xiaofan Zhou
SLSarah Lutteropp
Sarah Lutteropp
LCLucas Czech
Lucas Czech
ASAlexandros Stamatakis
Alexandros Stamatakis
MLMoritz von Looz
Moritz von Looz
Antonis RokasAntonis Rokas
Antonis Rokas
Incongruence, or topological conflict, is prevalent in genome-scale data sets but relatively few measures have been developed to quantify it. Internode Certainty (IC) and related measures were recently introduced to explicitly quantify the level of incongruence of a given internode (or internal branch) among a set of phylogenetic trees and complement regular branch support statistics in assessing the confidence of the inferred phylogenetic relationships. Since most phylogenomic studies contain data partitions (e.g., genes) with missing taxa and IC scores stem from the frequencies of bipartitions (or splits) on a set of trees, the calculation of IC scores requires adjusting the frequencies of bipartitions from these partial gene trees. However, when the proportion of missing data is high, current approaches that adjust bipartition frequencies in partial gene trees tend to overestimate IC scores and alternative adjustment approaches differ substantially from each other in their scores. To overcome these issues, we developed three new measures for calculating internode certainty that are based on the frequencies of quartets, which naturally apply to both comprehensive and partial trees. Our comparison of these new quartet-based measures to previous bipartition-based measures on simulated data shows that: 1) on comprehensive trees, both types of measures yield highly similar IC scores; 2) on partial trees, quartet-based measures generate more accurate IC scores; and 3) quartet-based measures are more robust to the absence of phylogenetic signal and errors in the phylogenetic relationships to be assessed. Additionally, analysis of 15 empirical phylogenomic data sets using our quartet-based measures suggests that numerous relationships remain unresolved despite the availability of genome-scale data. Finally, we provide an efficient open-source implementation of these quartet-based measures in the program QuartetScores , which is freely available at https://github.com/algomaus/QuartetScores .

1 January 2015 in Journal of Graph Algorithms and Applications
Verified
Journal Article
Open access
OAOswin Aichholzer
Oswin Aichholzer
Thomas HacklThomas Hackl
Thomas Hackl
SLSarah Lutteropp
Sarah Lutteropp
TMTamara Mchedlidze
Tamara Mchedlidze
APAlexander Pilz
Alexander Pilz
BVBirgit Vogtenhuber
Birgit Vogtenhuber

31 August 2021 in bioRxiv
Verified
Preprint
Open access
PDF file
SLSarah Lutteropp
Sarah Lutteropp
CSCéline Scornavacca
Céline Scornavacca
AKAlexey Kozlov
Alexey Kozlov
BMBenoit Morel
Benoit Morel
ASAlexandros Stamatakis
Alexandros Stamatakis
Phylogenetic networks are used to 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. Hence, current tools can only analyze small data sets. We present NetRAX, a tool for maximum likelihood inference of phylogenetic networks in the absence of incomplete lineage sorting. 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 maximum likelihood 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 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 8, 000 sites, 30 taxa, and 3 reticulations completes within a few minutes on a standard laptop. Our implementation is available under the GNU General Public License v3.0 at https://github.com/lutteropp/NetRAX .