EDBT 2026 Demo / reviewers in the wild / expert
Ziwei Xue
dblp:301/5017
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 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 › gene expression analysis › differential expression analysis
differentially expressed gene identification |
0.5 | 1 | 2021 | RAD: a web application to identify region associated differentially expressed genes · Bioinform. 2021 |
Bioinformatics and computational biology › gene regulation
gene regulation analysis |
0.5 | 1 | 2021 | RAD: a web application to identify region associated differentially expressed genes · Bioinform. 2021 |
Bioinformatics and computational biology
genomics |
0.5 | 1 | 2021 | RAD: a web application to identify region associated differentially expressed genes · Bioinform. 2021 |
Methods — techniques the papers use, named apart from their topics
statistical inference · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | An optimized hardware implementation of SHA-256 round computationabstractAbstract The SHA-256 algorithm is one of the most widely used secure hashing algorithms. The SHA-256 algorithm is implemented in hardware, and in order to ensure the integrity and authenticity of the encrypted data, this requires higher throughput and efficiency. In this paper, we propose a high-performance hardware architecture for the SHA-256 hash algorithm, which further optimizes the rearranged round computation by decomposing the critical path into two addition stages and replacing the multi-operator adder in the critical path of the algorithmic round-computing circuit with a 4-2 compressor. Based on the experimental results on field-programmable gate arrays, the obtained result shows a significant improvement in the performance of the proposed SHA-256 algorithm when compared with various existing architectures. Its maximum clock frequency is 366 MHz, with a throughput of 1990 Mbps and an improved efficiency of 1.86 Mbps per slice. Maoqun Yao, Ziwei Xue, Shanhu Shen |
Comput. J. | 2 |
| 2021 | RAD: a web application to identify region associated differentially expressed genesabstractSUMMARY: With the advance of genomic sequencing techniques, chromatin accessible regions, transcription factor binding sites and epigenetic modifications can be identified at genome-wide scale. Conventional analyses focus on the gene regulation at proximal regions; however, distal regions are usually less focused, largely due to the lack of reliable tools to link these regions to coding genes. In this study, we introduce RAD (Region Associated Differentially expressed genes), a user-friendly web tool to identify both proximal and distal region associated differentially expressed genes (DEGs). With DEGs and genomic regions of interest (gROI) as input, RAD maps the up- and down-regulated genes associated with any gROI and helps researchers to infer the regulatory function of these regions based on the distance of gROI to differentially expressed genes. RAD includes visualization of the results and statistical inference for significance. AVAILABILITY AND IMPLEMENTATION: RAD is implemented with Python 3.7 and run on a Nginx server. RAD is freely available at https://labw.org/rad as online web service. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Ziwei Xue, Ruihong Yuan, Jingyi Jessica Li, William A. Pastor, Wanlu Liu |
Bioinform. | 2 |