Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qimin Zhang

dblp:42/5185 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
5since 2021 · last 2027
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2Theory of computation · 2 · 1 first-author

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › single-cell analysis › single-cell transcriptomics
single-cell transcript assembly
1.622025
Transcriptome assembly at single-cell resolution with Beaver · Bioinform. 2025
Accurate assembly of multiple RNA-seq samples with Aletsch · Bioinform. 2024
Bioinformatics and computational biology › sequence analysis › sequence assembly
transcriptome assembly
0.912025
Transcriptome assembly at single-cell resolution with Beaver · Bioinform. 2025
Bioinformatics and computational biology › transcriptomics
transcript assembly
0.812024
Accurate assembly of multiple RNA-seq samples with Aletsch · Bioinform. 2024

Methods — techniques the papers use, named apart from their topics

random forest · 1.6transcript fragment graph · 0.9dynamic programming · 0.9graph decomposition · 0.8
YearPublicationVenuePosition
2027 WS-CCNet: A central-channel network for weakly supervised point cloud segmentation of workpiece surface defects
Qimin Zhang
Expert Syst. Appl.1
2025 Transcriptome assembly at single-cell resolution with Beaver
abstract
MOTIVATION: The established single-cell RNA sequencing (scRNA-seq) technologies has revolutionized biological and biomedical research by enabling the measurement of gene expression at single-cell resolution. However, the fundamental challenge of reconstructing full-length transcripts for individual cells remains unresolved. Existing single-sample assembly approaches cannot leverage shared information across cells while meta-assembly approaches often fail to strike a balance between consensus assembly and preserving cell-specific expression signatures. RESULTS: We present Beaver, a cell-specific transcript assembler designed for short-read scRNA-seq data. Beaver implements a transcript fragment graph to organize individual assemblies and designs an efficient dynamic programming algorithm that searches for candidate full-length transcripts from the graph. Beaver incorporates two random forest models trained on 51 meticulously engineered features that accurately estimate the likelihood of each candidate transcript being expressed in individual cells. Our experiments, performed using both real and simulated Smart-seq3 scRNA-seq data, firmly show that Beaver substantially outperforms existing meta-assemblers and single-sample assemblers. At the same level of sensitivity, Beaver achieved 32.0%-64.6%, 13.5%-36.6%, and 9.8%-36.3% higher precision in average compared to meta-assemblers Aletsch, TransMeta, and PsiCLASS, respectively, with similar improvements over single-sample assemblers Scallop2 (10.1%-43.6%) and StringTie2 (24.3%-67.0%). AVAILABILITY AND IMPLEMENTATION: Beaver is freely available at https://github.com/Shao-Group/beaver. Scripts that reproduce the experimental results of this manuscript are available at https://github.com/Shao-Group/beaver-test.
Qian Shi 0006, Qimin Zhang, Mingfu Shao
Bioinform.2
2025 Local-global transformer-based point cloud segmentation network for workpiece surface defect grinding
Qimin Zhang, Qiang Wang 0001, Delin Qu
Mach. Vis. Appl.1
2024 Accurate assembly of multiple RNA-seq samples with Aletsch
abstract
MOTIVATION: High-throughput RNA sequencing has become indispensable for decoding gene activities, yet the challenge of reconstructing full-length transcripts persists. Traditional single-sample assemblers frequently produce fragmented transcripts, especially in single-cell RNA-seq data. While algorithms designed for assembling multiple samples exist, they encounter various limitations. RESULTS: We present Aletsch, a new assembler for multiple bulk or single-cell RNA-seq samples. Aletsch incorporates several algorithmic innovations, including a "bridging" system that can effectively integrate multiple samples to restore missed junctions in individual samples, and a new graph-decomposition algorithm that leverages "supporting" information across multiple samples to guide the decomposition of complex vertices. A standout feature of Aletsch is its application of a random forest model with 50 well-designed features for scoring transcripts. We demonstrate its robust adaptability across different chromosomes, datasets, and species. Our experiments, conducted on RNA-seq data from several protocols, firmly demonstrate Aletsch's significant outperformance over existing meta-assemblers. As an example, when measured with the partial area under the precision-recall curve (pAUC, constrained by precision), Aletsch surpasses the leading assemblers TransMeta by 22.9%-62.1% and PsiCLASS by 23.0%-175.5% on human datasets. AVAILABILITY AND IMPLEMENTATION: Aletsch is freely available at https://github.com/Shao-Group/aletsch. Scripts that reproduce the experimental results of this manuscript is available at https://github.com/Shao-Group/aletsch-test.
Qian Shi 0006, Qimin Zhang, Mingfu Shao
Bioinform.2
2023 Transcript assembly and annotations: Bias and adjustment
abstract
Transcript annotations play a critical role in gene expression analysis as they serve as a reference for quantifying isoform-level expression. The two main sources of annotations are RefSeq and Ensembl/GENCODE, but discrepancies between their methodologies and information resources can lead to significant differences. It has been demonstrated that the choice of annotation can have a significant impact on gene expression analysis. Furthermore, transcript assembly is closely linked to annotations, as assembling large-scale available RNA-seq data is an effective data-driven way to construct annotations, and annotations are often served as benchmarks to evaluate the accuracy of assembly methods. However, the influence of different annotations on transcript assembly is not yet fully understood. We investigate the impact of annotations on transcript assembly. Surprisingly, we observe that opposite conclusions can arise when evaluating assemblers with different annotations. To understand this striking phenomenon, we compare the structural similarity of annotations at various levels and find that the primary structural difference across annotations occurs at the intron-chain level. Next, we examine the biotypes of annotated and assembled transcripts and uncover a significant bias towards annotating and assembling transcripts with intron retentions, which explains above the contradictory conclusions. We develop a standalone tool, available at https://github.com/Shao-Group/irtool, that can be combined with an assembler to generate an assembly without intron retentions. We evaluate the performance of such a pipeline and offer guidance to select appropriate assembling tools for different application scenarios.
Qimin Zhang, Mingfu Shao
PLoS Comput. Biol.1
2020 Modeling a stochastic age-structured capital system with Poisson jumps using neural networks
Qimin Zhang, Feilong Cao, Chunmei Ding
Inf. Sci.2
2018 A stochastic epidemic model with nonmonotone incidence rate: Sufficient and necessary conditions for near-optimality
Wenjuan Guo, Qimin Zhang, Libin Rong
Inf. Sci.2
2015 Mean-square dissipativity of numerical methods for a class of stochastic neural networks with fractional Brownian motion and jumps
Weijun Ma, Baocang Ding, Hongfu Yang, Qimin Zhang
Neurocomputing4
2006 Analysis of Numerical Solutions to Stochastic Age-Dependent Population Equations
Qimin Zhang, Xining Li
ICIC (3)1
2005 Existence and Uniqueness of Strong Solutions for Stochastic Age-Dependent Population
Qimin Zhang, Chongzhao Han
AAIM1
2005 Searching for a counterfeit coin with two unreliable weighings
Wen An Liu, Qimin Zhang, Zan Kan Nie
Discret. Appl. Math.2