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

Alan Zheng

dblp:426/1798 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · unresolved

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
sequence analysis
0.912025
Fast and flexible minimizer digestion with <tt>digest</tt> · Bioinform. 2025
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly › de novo assembly
de bruijn graph assembly
0.312025
Fast and flexible minimizer digestion with <tt>digest</tt> · Bioinform. 2025
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.312025
Fast and flexible minimizer digestion with <tt>digest</tt> · Bioinform. 2025

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

syncmer · 0.9modimizer · 0.9minimizer · 0.9
YearPublicationVenuePosition
2025 Fast and flexible minimizer digestion with <tt>digest</tt>
abstract
SUMMARY: Minimizer digestion is an increasingly common component of bioinformatics tools, including tools for de Bruijn graph assembly and sequence classification. We describe a new open source tool and library to facilitate efficient digestion of genomic sequences. It can produce digests based on the related ideas of minimizers, modimizers or syncmers. Digest uses efficient data structures, scales well to many threads, and produces digests with expected spacings between digested elements. AVAILABILITY AND IMPLEMENTATION: Digest is implemented in C++17 with a Python API, and is available open-source at https://github.com/VeryAmazed/digest. The python library is available on Bioconda. Rust bindings are available as a public crate at https://crates.io/crates/digest-rs.
Alan Zheng, Ishmeal Lee, Vikram Shivakumar, Omar Y. Ahmed, Ben Langmead
Bioinform.1