Demo Data from EDBT 2026 / reviewers in the wild / expert
Stephane Le Bihan
dblp:242/6087
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1
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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis › sequence clustering
read clustering |
0.4 | 1 | 2019 | Alignment-free clustering of UMI tagged DNA molecules · Bioinform. 2019 |
Bioinformatics and computational biology
sequence analysis |
0.4 | 1 | 2019 | Alignment-free clustering of UMI tagged DNA molecules · Bioinform. 2019 |
Bioinformatics and computational biology › sequence analysis
sequencing data processing |
0.4 | 1 | 2019 | Alignment-free clustering of UMI tagged DNA molecules · Bioinform. 2019 |
Methods — techniques the papers use, named apart from their topics
minhashing · 0.4locality-sensitive hashing · 0.4graph connected components · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Alignment-free clustering of UMI tagged DNA moleculesabstractMOTIVATION: Next-Generation Sequencing has led to the availability of massive genomic datasets whose processing raises many challenges, including the handling of sequencing errors. This is especially pertinent in cancer genomics, e.g. for detecting low allele frequency variations from circulating tumor DNA. Barcode tagging of DNA molecules with unique molecular identifiers (UMI) attempts to mitigate sequencing errors; UMI tagged molecules are polymerase chain reaction (PCR) amplified, and the PCR copies of UMI tagged molecules are sequenced independently. However, the PCR and sequencing steps can generate errors in the sequenced reads that can be located in the barcode and/or the DNA sequence. Analyzing UMI tagged sequencing data requires an initial clustering step, with the aim of grouping reads sequenced from PCR duplicates of the same UMI tagged molecule into a single cluster, and the size of the current datasets requires this clustering process to be resource-efficient. RESULTS: We introduce Calib, a computational tool that clusters paired-end reads from UMI tagged sequencing experiments generated by substitution-error-dominant sequencing platforms such as Illumina. Calib clusters are defined as connected components of a graph whose edges are defined in terms of both barcode similarity and read sequence similarity. The graph is constructed efficiently using locality sensitive hashing and MinHashing techniques. Calib's default clustering parameters are optimized empirically, for different UMI and read lengths, using a simulation module that is packaged with Calib. Compared to other tools, Calib has the best accuracy on simulated data, while maintaining reasonable runtime and memory footprint. On a real dataset, Calib runs with far less resources than alignment-based methods, and its clusters reduce the number of tentative false positive in downstream variation calling. AVAILABILITY AND IMPLEMENTATION: Calib is implemented in C++ and its simulation module is implemented in Python. Calib is available at https://github.com/vpc-ccg/calib. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Baraa Orabi, Emre Erhan, Brian McConeghy, Stanislav Volik, Stephane Le Bihan, Robert Bell, Colin C. Collins, Cédric Chauve, Faraz Hach |
Bioinform. | 5 |