EDBT 2026 Demo / reviewers in the wild / expert
Omar Y. Ahmed
dblp:307/9934
· DBLP profile ↗
5ranked-venue papers
0as first author
5since 2021 · last 2025
0000-0002-9933-8508ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 4 since 2021Theory of computation · 1 · 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
3 papers |
Bioinformatics and computational biology · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
sequence analysis |
0.9 | 1 | 2025 | Fast and flexible minimizer digestion with <tt>digest</tt> · Bioinform. 2025 |
Bioinformatics and computational biology › sequence analysis
sequence classification |
0.8 | 1 | 2024 | Sigmoni: classification of nanopore signal with a compressed pangenome index · Bioinform. 2024 |
Bioinformatics and computational biology › sequence analysis › sequencing data analysis
coverage estimation |
0.5 | 1 | 2021 | Megadepth: efficient coverage quantification for BigWigs and BAMs · Bioinform. 2021 |
Bioinformatics and computational biology
genomics |
0.5 | 1 | 2021 | Megadepth: efficient coverage quantification for BigWigs and BAMs · Bioinform. 2021 |
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly › de novo assembly
de bruijn graph assembly |
0.3 | 1 | 2025 | Fast and flexible minimizer digestion with <tt>digest</tt> · Bioinform. 2025 |
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly |
0.3 | 1 | 2025 | Fast and flexible minimizer digestion with <tt>digest</tt> · Bioinform. 2025 |
Bioinformatics and computational biology › sequence analysis
sequence indexing |
0.2 | 1 | 2024 | Sigmoni: classification of nanopore signal with a compressed pangenome index · Bioinform. 2024 |
Methods — techniques the papers use, named apart from their topics
syncmer · 0.9modimizer · 0.9minimizer · 0.9signal quantization · 0.8matching statistics · 0.8co-linearity statistics · 0.8interval summarization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Fast and flexible minimizer digestion with <tt>digest</tt>abstractSUMMARY: 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. | 4 |
| 2024 | MEM-Based Pangenome Indexing for k-mer Queries
Stephen Hwang, Nathaniel K. Brown, Omar Y. Ahmed, Katharine M. Jenike, Sam Kovaka, Michael C. Schatz, Ben Langmead |
WABI | 3 |
| 2024 | Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digestsabstract; a minimizer digest; ■ a KATKA kernel of a minimizer digest. With a test dataset and these three representations of it, simulated reads and various parameter settings, we checked how many reads' longest MEMs occurred only in the sequences from which those reads were generated ("true positive" reads). For some parameter settings we achieved significant compression while only slightly decreasing the true-positive rate. Dominika Draesslerová, Omar Y. Ahmed, Travis Gagie, Jan Holub 0001, Ben Langmead, Giovanni Manzini, Gonzalo Navarro 0001 |
SEA | 2 |
| 2024 | Sigmoni: classification of nanopore signal with a compressed pangenome indexabstractSUMMARY: Improvements in nanopore sequencing necessitate efficient classification methods, including pre-filtering and adaptive sampling algorithms that enrich for reads of interest. Signal-based approaches circumvent the computational bottleneck of basecalling. But past methods for signal-based classification do not scale efficiently to large, repetitive references like pangenomes, limiting their utility to partial references or individual genomes. We introduce Sigmoni: a rapid, multiclass classification method based on the r-index that scales to references of hundreds of Gbps. Sigmoni quantizes nanopore signal into a discrete alphabet of picoamp ranges. It performs rapid, approximate matching using matching statistics, classifying reads based on distributions of picoamp matching statistics and co-linearity statistics, all in linear query time without the need for seed-chain-extend. Sigmoni is 10-100× faster than previous methods for adaptive sampling in host depletion experiments with improved accuracy, and can query reads against large microbial or human pangenomes. Sigmoni is the first signal-based tool to scale to a complete human genome and pangenome while remaining fast enough for adaptive sampling applications. AVAILABILITY AND IMPLEMENTATION: Sigmoni is implemented in Python, and is available open-source at https://github.com/vshiv18/sigmoni. Vikram Shivakumar, Omar Y. Ahmed, Sam Kovaka, Mohsen Zakeri, Ben Langmead |
Bioinform. | 2 |
| 2021 | Megadepth: efficient coverage quantification for BigWigs and BAMsabstractMOTIVATION: A common way to summarize sequencing datasets is to quantify data lying within genes or other genomic intervals. This can be slow and can require different tools for different input file types. RESULTS: Megadepth is a fast tool for quantifying alignments and coverage for BigWig and BAM/CRAM input files, using substantially less memory than the next-fastest competitor. Megadepth can summarize coverage within all disjoint intervals of the Gencode V35 gene annotation for more than 19 000 GTExV8 BigWig files in approximately 1 h using 32 threads. Megadepth is available both as a command-line tool and as an R/Bioconductor package providing much faster quantification compared to the rtracklayer package. AVAILABILITY AND IMPLEMENTATION: https://github.com/ChristopherWilks/megadepth, https://bioconductor.org/packages/megadepth. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Christopher Wilks, Omar Y. Ahmed, Daniel N. Baker, David Zhang 0004, Leonardo Collado-Torres, Ben Langmead |
Bioinform. | 2 |