EDBT 2026 Demo / reviewers in the wild / expert
Daqiang Tan
dblp:290/7364
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0001-9861-0082ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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 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
genomic sequence analysis |
0.6 | 1 | 2022 | KCOSS: an ultra-fast k-mer counter for assembled genome analysis · Bioinform. 2022 |
Bioinformatics and computational biology › sequence analysis › k-mer analysis
k-mer counting |
0.6 | 1 | 2022 | KCOSS: an ultra-fast k-mer counter for assembled genome analysis · Bioinform. 2022 |
Bioinformatics and computational biology › sequence analysis › sequence assembly
whole genome assembly analysis |
0.6 | 1 | 2022 | KCOSS: an ultra-fast k-mer counter for assembled genome analysis · Bioinform. 2022 |
Methods — techniques the papers use, named apart from their topics
lock-free thread pool · 0.6lock-free queue · 0.6cuckoo hash table · 0.6bloom filter · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | KCOSS: an ultra-fast k-mer counter for assembled genome analysisabstractMOTIVATION: The k-mer frequency in whole genome sequences provides researchers with an insightful perspective on genomic complexity, comparative genomics, metagenomics and phylogeny. The current k-mer counting tools are typically slow, and they require large memory and hard disk for assembled genome analysis. RESULTS: We propose a novel and ultra-fast k-mer counting algorithm, KCOSS, to fulfill k-mer counting mainly for assembled genomes with segmented Bloom filter, lock-free queue, lock-free thread pool and cuckoo hash table. We optimize running time and memory consumption by recycling memory blocks, merging multiple consecutive first-occurrence k-mers into C-read, and writing a set of C-reads to disk asynchronously. KCOSS was comparatively tested with Jellyfish2, CHTKC and KMC3 on seven assembled genomes and three sequencing datasets in running time, memory consumption, and hard disk occupation. The experimental results show that KCOSS counts k-mer with less memory and disk while having a shorter running time on assembled genomes. KCOSS can be used to calculate the k-mer frequency not only for assembled genomes but also for sequencing data. AVAILABILITYAND IMPLEMENTATION: The KCOSS software is implemented in C++. It is freely available on GitHub: https://github.com/kcoss-2021/KCOSS. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Deyou Tang, Daqiang Tan, Juan Fu, Yelei Tang, Jiabin Lin, Hongli Du, Zhongming Zhao |
Bioinform. | 3 |
| 2021 | A computational model of emotion based on audio-visual stimuli understanding and personalized regulation with concurrencyabstractAbstract The target of Emotion modeling is to establish an system that can perceive, recognize, and express emotions with concurrency which humanity have by proper mathematical models. A big challenge in Emotion modeling is to establish the complex personal system of an intelligent agent or machine in a quasi‐physical and quasi‐sociological way, so that it rationally responds to emotions and behaviors by different internal and external stimuli with concurrency. For this purpose, an emotion classification model is presented for the audio‐visual external stimuli based on an improved long short‐term memory network. Then, based on Gross's emotional regulation theory, a hidden Markov model is constructed to imitate the process framework of human emotional cognition and personalized emotional regulation and expression, so as to realize the machine's intuitive and reasonable response to stimuli with concurrency. In this article, a framework of machine personalized artificial emotion simulation is preliminarily constructed, which provides a new model for human–computer interaction, in order to provide a reference solution for machine emotion understanding and expression. Dazhi Jiang, Donghui Jin, Jiaxi Zhuang, Daqiang Tan, Dicheng Chen, Yujie Liang |
Concurr. Comput. Pract. Exp. | 4 |