Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Deyou Tang has a total of 46 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • ScalableAligner: a fast NGS mapping tool for shared-memory system

    by Deyou Tang, Jialang Liang, Pingjian Zhang, Qingwen Deng

  • Smart-SNPer: Automated crRNA design for ultrasensitive RPA-Cas12a SNP detection

    by Liya Han, Wenjun Feng, Lv Wang, Feng Chen, Tianyi Tan, Yongchong Zhu, Wenyan Li, Yunpeng Yang, Wenyi Xu, Yue Li, et al.


  • BTR-MCL: A Bioinformatics Tool Recommendation Method With Multi-View Contrastive Learning

    by Deyou Tang, Biyao Lv, Rong Zhao, Pingjian Zhang, Chao Liu

    Digital informatization in bioinformatics research has developed rapidly, resulting in the emergence of tens of thousands of bioinformatics tools in recent decades. However, few researchers systematically study how to manage and recommend bioinformatics tools. Meanwhile, existing recommendation methods suffer from the incompatibility with bioinformatics tool recommendations, specifically, i) the inability to mine a large amount of descriptive information and potential correlations of bioinformatics tools to make up for the sparse problem of operation-tool history interaction; ii) the inability to accommodate recommendations dominated by tools (i.e., items). To address these problems, we collected quantitative bioinformatics operations, tools, and context (i.e., topics and papers) from the authoritative portal (https://bio.tools) and constructed a knowledge graph dataset for the bioinformatics tools. Based on this, we propose the Bioinformatics Tool Recommendation Method with Multi-view Contrastive Learning (BTR-MCL). The method utilizes BERT to enrich the semantic information of entities and constructs three fine-grained views for multi-view contrastive learning, namely the tool-tool graph named TT view, the operation-tool graph named OT view, and the bioinformatics tools knowledge graph as global structure named KG view. By enhancing the importance of tool embedding in local and global contrastive learning and learning rich semantic information, BTR-MCL achieves significant improvements over state-of-theart baselines on the top-K recommendation, outperforming the higher 82.71% of the best baseline on the Recall@10 metric

  • Open Access

    PGDA-KGQA: A Prompt-Guided Generative Framework with Multiple Data Augmentation Strategies for Knowledge Graph Question Answering

    by Xiujun Zhou, Pingjian Zhang, Deyou Tang

    Knowledge Graph Question Answering (KGQA) is a crucial task in natural language processing that requires reasoning over knowledge graphs (KGs) to answer natural language questions. Recent methods utilizing large language models (LLMs) have shown remarkable semantic parsing capabilities but are limited by the scarcity of diverse annotated data and multi-hop reasoning samples. Traditional data augmentation approaches are focus mainly on single-hop questions and prone to semantic distortion, while LLM-based methods primarily address semantic distortion but usually neglect multi-hop reasoning, thus limiting data diversity. The scarcity of multi-hop samples further weakens models' generalization. To address these issues, we propose PGDA-KGQA, a prompt-guided generative framework with multiple data augmentation strategies for KGQA. At its core, PGDA-KGQA employs a unified prompt-design paradigm: by crafting meticulously engineered prompts that integrate the provided textual content, it leverages LLMs to generate large-scale (question, logical form) pairs for model training. Specifically, PGDA-KGQA enriches its training set by: (1) generating single-hop pseudo questions to improve the alignment of question semantics with KG relations; (2) applying semantic-preserving question rewriting to improve robustness against linguistic variations; (3) employing answer-guided reverse path exploration to create realistic multi-hop questions. By adopting an augment-generate-retrieve semantic parsing pipeline, PGDA-KGQA utilizes the augmented data to enhance the accuracy of logical form generation and thus improve answer retrieval performance. Experiments demonstrate that outperforms state-of-the-art methods on standard KGQA datasets, achieving improvements on WebQSP by 2.8%, 1.2%, and 3.1% and on ComplexWebQuestions by 1.8%, 1.1%, and 2.4% in F1, Hits@1, and Accuracy, respectively.

  • A scientific paper recommendation method using the time decay heterogeneous graph

    by Zhenye Huang, Deyou Tang, Rong Zhao, Wenjing Rao


  • Open Access

    Modeling the Data Provenance of Relational Databases Supporting Full-Featured SQL and Procedural Languages

    by Deyou Tang, Rong Zhao, Yuebang Lin, Tangqing Zhang, Pingjian Zhang

    Data provenance is information about where data come from (provenance data) and how they transform (provenance transformation). Data provenance is widely used to evaluate data quality, trace errors, audit data, and understand references among data. Current studies on data provenance in relational database management systems (RDBMS) still have limitations in supporting full-featured SQL or procedural languages. With these challenges in mind, we present a formal definition of provenance data and provenance transformation for relational data. Then, we propose a solution to support data provenance in relational databases, including provenance graphs and provenance routes. Our method not only solves the complicated problem of modeling provenance in DBMS but also is capable of extending procedural languages in SQL. We also present ProvPg, a PostgreSQL-based prototype database system supporting data provenance in multiple granularities. ProvPg implements extraction, calculation, query, and visualization of provenance. We perform TPC-H tests for ProvPg and PostgreSQL, respectively. Experimental results show that ProvPg addresses the vision of supporting data provenance with little extra computation overhead for the execution engine, which indicates that our model is applicable to lineage tracing applications.


  • Open Access

    KMC3 and CHTKC: Best Scenarios, Deficiencies, and Challenges in High-Throughput Sequencing Data Analysis

    by Deyou Tang, Daqiang Tan, Weihao Xiao, Jiabin Lin, Juan Fu

    Background: K-mer frequency counting is an upstream process of many bioinformatics data analysis workflows. KMC3 and CHTKC are the representative partition-based k-mer counting and non-partition-based k-mer counting algorithms, respectively. This paper evaluates the two algorithms and presents their best applicable scenarios and potential improvements using multiple hardware contexts and datasets. Results: KMC3 uses less memory and runs faster than CHTKC on a regular configuration server. CHTKC is efficient on high-performance computing platforms with high available memory, multi-thread, and low IO bandwidth. When tested with various datasets, KMC3 is less sensitive to the number of distinct k-mers and is more efficient for tasks with relatively low sequencing quality and long k-mer. CHTKC performs better than KMC3 in counting assignments with large-scale datasets, high sequencing quality, and short k-mer. Both algorithms are affected by IO bandwidth, and decreasing the influence of the IO bottleneck is critical as our tests show improvement by filtering and compressing consecutive first-occurring k-mers in KMC3. Conclusions: KMC3 is more competitive for running counter on ordinary hardware resources, and CHTKC is more competitive for counting k-mers in super-scale datasets on higher-performance computing platforms. Reducing the influence of the IO bottleneck is essential for optimizing the k-mer counting algorithm, and filtering and compressing low-frequency k-mers is critical in relieving IO impact.

  • KCOSS: an ultra-fast k-mer counter for assembled genome analysis

    by Deyou Tang, Yucheng Li, Daqiang Tan, Juan Fu, Yelei Tang, Jiabin Lin, Rong Zhao, Hongli Du, Zhongming Zhao

    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. 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. The KCOSS software is implemented in C++. It is freely available on GitHub: https://github.com/kcoss-2021/KCOSS. Supplementary data are available at Bioinformatics online.