Demo Data from EDBT 2026 / reviewers in the wild / expert
Mark J. P. Chaisson
dblp:311/7014
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0001-5395-1457ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 1 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% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis › read mapping
long-read alignment |
0.7 | 1 | 2023 | HQAlign: aligning nanopore reads for SV detection using current-level modeling · Bioinform. 2023 |
Bioinformatics and computational biology
sequence alignment |
0.7 | 1 | 2023 | HQAlign: aligning nanopore reads for SV detection using current-level modeling · Bioinform. 2023 |
Bioinformatics and computational biology › genomics › structural variation
structural variant detection |
0.7 | 1 | 2023 | HQAlign: aligning nanopore reads for SV detection using current-level modeling · Bioinform. 2023 |
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly |
0.3 | 1 | 2017 | Resolving Multicopy Duplications de novo Using Polyploid Phasing · RECOMB 2017 |
Bioinformatics and computational biology › statistical genetics › haplotype analysis
haplotype phasing |
0.3 | 1 | 2017 | Resolving Multicopy Duplications de novo Using Polyploid Phasing · RECOMB 2017 |
Methods — techniques the papers use, named apart from their topics
current-level modeling · 0.7basecalling · 0.7polyploid phasing · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | HQAlign: aligning nanopore reads for SV detection using current-level modelingabstractMOTIVATION: Detection of structural variants (SVs) from the alignment of sample DNA reads to the reference genome is an important problem in understanding human diseases. Long reads that can span repeat regions, along with an accurate alignment of these long reads play an important role in identifying novel SVs. Long-read sequencers, such as nanopore sequencing, can address this problem by providing very long reads but with high error rates, making accurate alignment challenging. Many errors induced by nanopore sequencing have a bias because of the physics of the sequencing process and proper utilization of these error characteristics can play an important role in designing a robust aligner for SV detection problems. In this article, we design and evaluate HQAlign, an aligner for SV detection using nanopore sequenced reads. The key ideas of HQAlign include (i) using base-called nanopore reads along with the nanopore physics to improve alignments for SVs, (ii) incorporating SV-specific changes to the alignment pipeline, and (iii) adapting these into existing state-of-the-art long-read aligner pipeline, minimap2 (v2.24), for efficient alignments. RESULTS: We show that HQAlign captures about 4%-6% complementary SVs across different datasets, which are missed by minimap2 alignments while having a standalone performance at par with minimap2 for real nanopore reads data. For the common SV calls between HQAlign and minimap2, HQAlign improves the start and the end breakpoint accuracy by about 10%-50% for SVs across different datasets. Moreover, HQAlign improves the alignment rate to 89.35% from minimap2 85.64% for nanopore reads alignment to recent telomere-to-telomere CHM13 assembly, and it improves to 86.65% from 83.48% for nanopore reads alignment to GRCh37 human genome. AVAILABILITY AND IMPLEMENTATION: https://github.com/joshidhaivat/HQAlign.git. Dhaivat Joshi, Suhas N. Diggavi, Mark J. P. Chaisson, Sreeram Kannan |
Bioinform. | 3 |
| 2021 | lra: A long read aligner for sequences and contigsabstractIt is computationally challenging to detect variation by aligning single-molecule sequencing (SMS) reads, or contigs from SMS assemblies. One approach to efficiently align SMS reads is sparse dynamic programming (SDP), where optimal chains of exact matches are found between the sequence and the genome. While straightforward implementations of SDP penalize gaps with a cost that is a linear function of gap length, biological variation is more accurately represented when gap cost is a concave function of gap length. We have developed a method, lra, that uses SDP with a concave-cost gap penalty, and used lra to align long-read sequences from PacBio and Oxford Nanopore (ONT) instruments as well as de novo assembly contigs. This alignment approach increases sensitivity and specificity for SV discovery, particularly for variants above 1kb and when discovering variation from ONT reads, while having runtime that are comparable (1.05-3.76×) to current methods. When applied to calling variation from de novo assembly contigs, there is a 3.2% increase in Truvari F1 score compared to minimap2+htsbox. lra is available in bioconda (https://anaconda.org/bioconda/lra) and github (https://github.com/ChaissonLab/LRA). Jingwen Ren, Mark J. P. Chaisson |
PLoS Comput. Biol. | 2 |
| 2017 | Resolving Multicopy Duplications de novo Using Polyploid Phasing
Mark J. P. Chaisson, Sudipto Mukherjee 0001, Sreeram Kannan, Evan E. Eichler |
RECOMB | 1 |