APDCA: An accurate and effective method for predicting associations between RBPs and AS-events during epithelial-mesenchymal transition

We propose a new method based on Accelerated Proximal DC Algorithm (APDCA) for predicting RBP-AS associations. In particular, APDCA combines sparse low-rank matrix factorization with a Difference-of-Convex (DC) optimization framework and uses extrapolation to improve convergence. A key feature of APDCA is the use of a sparsity constraint, which filters out noise and highlights key associations. In addition, integrating multiple related data sources with direct or indirect relationships can help in reaching a more comprehensive view of RBPs and AS events and to reduce the impact of false positives associated with individual data sources. we prove that our proposed algorithm is convergent under some conditions and the experimental results have illustrated that APDCA outperforms six baseline methods in both AUC and AUPR. A case study on the RBP QKI shows that the top predictions are verified by the OncoSplicing database. Thus, APDCA provides a fast, interpretable, and scalable tool for discovering post-transcriptional regulatory interactions.

Authors

Institutions

Publication Details

Journal
PLoS Computational Biology
Published
2025-11-06
DOI
https://doi.org/10.1371/journal.pcbi.1013665
Citations
1
Primary Topic
Genomics and Chromatin Dynamics
Type
article
Field-Weighted Citation Impact
0.81
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

APDCA: An accurate and effective method for predicting associations between RBPs and AS-events during epithelial-mesenchymal transition

Quan Zou, Zheng‐Jian Bai, Yushan Qiu, Wai‐Ki Ching et al.
1 citations
PLoS Computational Biology
Genomics and Chromatin Dynamics
0.81
article

APDCA: An accurate and effective method for predicting associations between RBPs and AS-events during epithelial-mesenchymal transition

Quan Zou, Zheng‐Jian Bai, Yushan Qiu, Wai‐Ki Ching, Yihua He
article en
1 citations

Abstract

We propose a new method based on Accelerated Proximal DC Algorithm (APDCA) for predicting RBP-AS associations. In particular, APDCA combines sparse low-rank matrix factorization with a Difference-of-Convex (DC) optimization framework and uses extrapolation to improve convergence. A key feature of APDCA is the use of a sparsity constraint, which filters out noise and highlights key associations. In addition, integrating multiple related data sources with direct or indirect relationships can help in reaching a more comprehensive view of RBPs and AS events and to reduce the impact of false positives associated with individual data sources. we prove that our proposed algorithm is convergent under some conditions and the experimental results have illustrated that APDCA outperforms six baseline methods in both AUC and AUPR. A case study on the RBP QKI shows that the top predictions are verified by the OncoSplicing database. Thus, APDCA provides a fast, interpretable, and scalable tool for discovering post-transcriptional regulatory interactions.

PLoS Computational BiologyVol. 21(11)
University of Electronic Science and Technology of China (CN), Shenzhen University (CN), Xiamen University (CN), University of Hong Kong (HK)
Openalex Percentile: Top 22%
Genomics and Chromatin Dynamics
0.81
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.