Demo Data from VLDB 2026 / reviewers in the wild / expert
Töresin Karakoyun
dblp:71/8644
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 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
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis
sequencing data analysis |
0.9 | 1 | 2025 | UMI-nea: a fast, robust tool for reference-free UMI deduplication and accurate quantification · Bioinform. 2025 |
Bioinformatics and computational biology › sequence analysis › sequencing data processing
unique molecular identifier deduplication |
0.9 | 1 | 2025 | UMI-nea: a fast, robust tool for reference-free UMI deduplication and accurate quantification · Bioinform. 2025 |
Methods — techniques the papers use, named apart from their topics
levenshtein distance · 0.9clustering · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | UMI-nea: a fast, robust tool for reference-free UMI deduplication and accurate quantificationabstractMOTIVATION: One of the key applications of Unique Molecular Identifiers (UMIs) in high-throughput sequencing is to correct for PCR amplification bias and removal of PCR duplicates, thereby improving quantification in DNA-seq and RNA-seq applications. Accurately grouping error-bearing UMIs that originate from the same input molecule through a UMI deduplication method is a critical step in this process. However, many existing UMI deduplication tools rely on simple Hamming distance comparisons or suboptimal clustering algorithms, often resulting in erroneous UMI groupings, particularly in error-prone long-read sequencing or ultra-high-depth short-read sequencing. RESULTS: We introduce UMI-nea, a tool that utilizes Levenshtein distance comparisons and a novel clustering approach to optimize multithreading workflows. Compared against three other indel-aware UMI deduplication tools, UMI-nea achieves more accurate UMI groupings with efficient run time. It demonstrates robust performance across diverse sequencing platforms, depths, and UMI lengths. Additionally, UMI-nea incorporates a data-guided adaptive UMI filter, further enhancing quantification accuracy. AVAILABILITY AND IMPLEMENTATION: UMI-nea is available on github https://github.com/Qiaseq-research/UMI-nea.git or Zenodo https://doi.org/10.5281/zenodo.16745758. Sequencing data are stored at https://qiagenpublic.blob.core.windows.net/umi-nea-datasets/. Jixin Deng, Jingxiao Zhang, Song Tian, John Dicarlo, Samuel J. Rulli, Jonathan M. Shaffer, Töresin Karakoyun |
Bioinform. | 9 |
| 2016 | Clinical Trial Information Mediator
Christian Krauth, Wolfgang Kuchinke, Martin Eckert, René Bergmann, Benjamin Braasch, Töresin Karakoyun, Christian Ohmann |
J. Biomed. Informatics | 6 |
| 2015 | Using electronic health records for clinical research: The case of the EHR4CR project
Georges De Moor, Mats Sundgren, Dipak Kalra, Andreas Schmidt 0004, Martin Dugas, Brecht Claerhout, Töresin Karakoyun, Christian Ohmann, Pierre-Yves Lastic, Nadir Ammour, Rebecca Daniels Kush, Danielle Dupont, Marc Cuggia, Christel Daniel-Le Bozec, Geert Thienpont, Pascal Coorevits |
J. Biomed. Informatics | 7 |