Ghanshyam Chandra

dblp:345/7968 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2026
0000-0001-7687-4132ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 5 · 4 first-author · 5 since 2021
YearPublicationVenuePosition
2026 Accelerating minimap2 for whole-genome alignment
abstract
SUMMARY: Recent advances in long-read sequencing and genome assembly techniques have enabled the generation of high-quality assemblies, often comprising megabase-scale sequences that span entire chromosomes. This results in longer but fewer sequences per genome, which affects the parallelization efficiency of whole-genome alignment tools. Current methods that assign one thread per query sequence now face suboptimal CPU use and longer runtimes because the processing of fewer sequences leaves many threads idle. We present mm2-plus, a fast and efficient method for whole-genome alignment, built upon the commonly used minimap2 aligner. Our improvements include a fine-grained parallel chaining algorithm and a fast method for differentiating primary and secondary chains. These optimizations accelerate the alignment of human, plant, and primate genomes by 1.6× to 7.2× without compromising accuracy. AVAILABILITY AND IMPLEMENTATION: Source code is available at https://github.com/at-cg/mm2-plus and https://doi.org/10.5281/zenodo.18220923.
Ghanshyam Chandra, Md. Vasimuddin, Sanchit Misra
Bioinform.1
2025 Integer Programming Framework for Pangenome-Based Genome Inference
Ghanshyam Chandra, Md. Helal Hossen, Stephan Scholz, Alexander T. Dilthey, Daniel Gibney
RECOMB1
2024 Haplotype-Aware Sequence Alignment to Pangenome Graphs
Ghanshyam Chandra, Daniel Gibney
RECOMB1
2023 Sequence to Graph Alignment Using Gap-Sensitive Co-linear Chaining
Ghanshyam Chandra
RECOMB1
2023 Co-Linear Chaining on Pangenome Graphs
abstract
assembly algorithm that combines multiple sequencing technologies to scale up population-wide telomere-to-telomere assemblies. By utilizing twenty-two human and two plant genomes, we demonstrate that our algorithm is around an order of magnitude cheaper than existing methods, while producing better diploid and haploid assemblies. Notably, our algorithm is the only feasible solution to the haplotype-resolved assembly of polyploid genomes.
Jyotshna Rajput, Ghanshyam Chandra
WABI2