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

Taher Mun

dblp:230/4345 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0002-3588-0883ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 2 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
2 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
read mapping
0.512021
LevioSAM: fast lift-over of variant-aware reference alignments · Bioinform. 2021
Bioinformatics and computational biology
genomics
0.412019
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment · RECOMB 2019
Bioinformatics and computational biology › comparative genomics › pangenomics
pangenome indexing
0.412019
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment · RECOMB 2019
Bioinformatics and computational biology
population genetics
0.112021
LevioSAM: fast lift-over of variant-aware reference alignments · Bioinform. 2021
Algorithms and data structures › sequence algorithms › string algorithms › string indexing
compressed index
0.112019
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment · RECOMB 2019
Algorithms and data structures › sequence algorithms › string algorithms
string indexing
0.112019
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment · RECOMB 2019

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

pan-genome indexing · 0.8burrows-wheeler transform · 0.8succinct data structures · 0.5multithreading · 0.5
YearPublicationVenuePosition
2022 Pangenomic Genotyping with the Marker Array
Taher Mun, Naga Sai Kavya Vaddadi, Ben Langmead
WABI1
2021 LevioSAM: fast lift-over of variant-aware reference alignments
abstract
MOTIVATION: As more population genetics datasets and population-specific references become available, the task of translating ('lifting') read alignments from one reference coordinate system to another is becoming more common. Existing tools generally require a chain file, whereas VCF files are the more common way to represent variation. Existing tools also do not make effective use of threads, creating a post-alignment bottleneck. RESULTS: LevioSAM is a tool for lifting SAM/BAM alignments from one reference to another using a VCF file containing population variants. LevioSAM uses succinct data structures and scales efficiently to many threads. When run downstream of a read aligner, levioSAM is more than 7 times faster than an aligner when both are run with 16 threads. AVAILABILITY AND IMPLEMENTATION: Software Package: https://github.com/alshai/levioSAM, Experiments: https://github.com/langmead-lab/levioSAM-experiments. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Taher Mun, Nae-Chyun Chen, Ben Langmead
Bioinform.1
2019 Efficient Construction of a Complete Index for Pan-Genomics Read Alignment
Alan Kuhnle, Taher Mun, Christina Boucher 0001, Travis Gagie, Ben Langmead, Giovanni Manzini
RECOMB2