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

Lucas Czech

dblp:218/8667 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
3since 2021 · last 2024
0000-0002-1340-9644ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 5 · 4 first-author · 3 since 2021

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

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.822020
Genesis and Gappa: processing, analyzing and visualizing phylogenetic (placement) data · Bioinform. 2020
Methods for automatic reference trees and multilevel phylogenetic placement · Bioinform. 2019
Bioinformatics and computational biology › population genetics › genetic variation analysis
genetic diversity analysis
0.812024
grenedalf: population genetic statistics for the next generation of pool sequencing · Bioinform. 2024
Bioinformatics and computational biology
population genetics
0.812024
grenedalf: population genetic statistics for the next generation of pool sequencing · Bioinform. 2024
Bioinformatics and computational biology
genomics
0.612022
grenepipe: a flexible, scalable and reproducible pipeline to automate variant calling from sequence reads · Bioinform. 2022
Bioinformatics and computational biology › sequence analysis › sequencing data analysis
sequencing data analysis pipeline
0.612022
grenepipe: a flexible, scalable and reproducible pipeline to automate variant calling from sequence reads · Bioinform. 2022
Bioinformatics and computational biology › genomics
variant calling
0.612022
grenepipe: a flexible, scalable and reproducible pipeline to automate variant calling from sequence reads · Bioinform. 2022
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
phylogenetic placement
0.412019
Methods for automatic reference trees and multilevel phylogenetic placement · Bioinform. 2019
Bioinformatics and computational biology
metagenomics
0.322021
Swarm v3: towards tera-scale amplicon clustering · Bioinform. 2021
Methods for automatic reference trees and multilevel phylogenetic placement · Bioinform. 2019
Bioinformatics and computational biology › statistical genetics
genotype calling
0.212022
grenepipe: a flexible, scalable and reproducible pipeline to automate variant calling from sequence reads · Bioinform. 2022
Bioinformatics and computational biology › population genetics
population genomics
0.212022
grenepipe: a flexible, scalable and reproducible pipeline to automate variant calling from sequence reads · Bioinform. 2022
Bioinformatics and computational biology › phylogenetics › phyloinformatics
phylogenetic tree visualization
0.112020
Genesis and Gappa: processing, analyzing and visualizing phylogenetic (placement) data · Bioinform. 2020
Bioinformatics and computational biology › metagenomics
taxonomic profiling
0.112019
Methods for automatic reference trees and multilevel phylogenetic placement · Bioinform. 2019

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

θ estimation · 0.8tajima's d · 0.8FST · 0.8workflow automation · 0.6snakemake · 0.6multithreading · 0.5c++ optimization · 0.5command-line tool · 0.4c++ library · 0.4nested phylogeny · 0.4
YearPublicationVenuePosition
2024 grenedalf: population genetic statistics for the next generation of pool sequencing
abstract
SUMMARY: Pool sequencing is an efficient method for capturing genome-wide allele frequencies from multiple individuals, with broad applications such as studying adaptation in Evolve-and-Resequence experiments, monitoring of genetic diversity in wild populations, and genotype-to-phenotype mapping. Here, we present grenedalf, a command line tool written in C++ that implements common population genetic statistics such as θ, Tajima's D, and FST for Pool sequencing. It is orders of magnitude faster than current tools, and is focused on providing usability and scalability, while also offering a plethora of input file formats and convenience options. AVAILABILITY AND IMPLEMENTATION: grenedalf is published under the GPL-3, and freely available at github.com/lczech/grenedalf.
Lucas Czech, Jeffrey P. Spence, Moisés Expósito-Alonso
Bioinform.1
2022 grenepipe: a flexible, scalable and reproducible pipeline to automate variant calling from sequence reads
abstract
SUMMARY: We developed grenepipe, an all-in-one Snakemake workflow to streamline the data processing from raw high-throughput sequencing data of individuals or populations to genotype variant calls. Our pipeline offers a range of popular software tools within a single configuration file, automatically installs software dependencies, is highly optimized for scalability in cluster environments and runs with a single command. AVAILABILITY AND IMPLEMENTATION: grenepipe is published under the GPLv3 and freely available at github.com/moiexpositoalonsolab/grenepipe.
Lucas Czech, Moisés Expósito-Alonso
Bioinform.1
2021 Swarm v3: towards tera-scale amplicon clustering
abstract
MOTIVATION: Previously we presented swarm, an open-source amplicon clustering programme that produces fine-scale molecular operational taxonomic units (OTUs) that are free of arbitrary global clustering thresholds. Here, we present swarm v3 to address issues of contemporary datasets that are growing towards tera-byte sizes. RESULTS: When compared with previous swarm versions, swarm v3 has modernized C++ source code, reduced memory footprint by up to 50%, optimized CPU-usage and multithreading (more than 7 times faster with default parameters), and it has been extensively tested for its robustness and logic. AVAILABILITY AND IMPLEMENTATION: Source code and binaries are available at https://github.com/torognes/swarm. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Frédéric Mahé, Lucas Czech, Alexandros Stamatakis, Christopher Quince, Colomban de Vargas, Micah Dunthorn, Torbjørn Rognes
Bioinform.2
2020 Genesis and Gappa: processing, analyzing and visualizing phylogenetic (placement) data
abstract
SUMMARY: We present genesis, a library for working with phylogenetic data, and gappa, an accompanying command-line tool for conducting typical analyses on such data. The tools target phylogenetic trees and phylogenetic placements, sequences, taxonomies and other relevant data types, offer high-level simplicity as well as low-level customizability, and are computationally efficient, well-tested and field-proven. AVAILABILITY AND IMPLEMENTATION: Both genesis and gappa are written in modern C++11, and are freely available under GPLv3 at http://github.com/lczech/genesis and http://github.com/lczech/gappa. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Lucas Czech, Pierre Barbera, Alexandros Stamatakis
Bioinform.1
2019 Methods for automatic reference trees and multilevel phylogenetic placement
abstract
MOTIVATION: In most metagenomic sequencing studies, the initial analysis step consists in assessing the evolutionary provenance of the sequences. Phylogenetic (or Evolutionary) Placement methods can be employed to determine the evolutionary position of sequences with respect to a given reference phylogeny. These placement methods do however face certain limitations: The manual selection of reference sequences is labor-intensive; the computational effort to infer reference phylogenies is substantially larger than for methods that rely on sequence similarity; the number of taxa in the reference phylogeny should be small enough to allow for visually inspecting the results. RESULTS: We present algorithms to overcome the above limitations. First, we introduce a method to automatically construct representative sequences from databases to infer reference phylogenies. Second, we present an approach for conducting large-scale phylogenetic placements on nested phylogenies. Third, we describe a preprocessing pipeline that allows for handling huge sequence datasets. Our experiments on empirical data show that our methods substantially accelerate the workflow and yield highly accurate placement results. AVAILABILITY AND IMPLEMENTATION: Freely available under GPLv3 at http://github.com/lczech/gappa. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Lucas Czech, Pierre Barbera, Alexandros Stamatakis
Bioinform.1