Results 1 to 10 of about 158,513 (260)
Double matrix completion for circRNA-disease association prediction [PDF]
BMC Bioinformatics, 2021 Background Circular RNAs (circRNAs) are a class of single-stranded RNA molecules with a closed-loop structure. A growing body of research has shown that circRNAs are closely related to the development of diseases. Because biological experiments to verify
Zong-Lan Zuo +4 more
doaj +2 more sources
Predicting miRNA-Disease Association Based on Neural Inductive Matrix Completion with Graph Autoencoders and Self-Attention Mechanism [PDF]
Biomolecules, 2022 Many studies have clarified that microRNAs (miRNAs) are associated with many human diseases. Therefore, it is essential to predict potential miRNA-disease associations for disease pathogenesis and treatment.
Chen Jin +3 more
doaj +2 more sources
SeqBMC: Single‐cell data processing using iterative block matrix completion algorithm based on matrix factorisation [PDF]
IET Systems BiologyWith the development of high‐throughput sequencing technology, the analysis of single‐cell RNA sequencing data has become the focus of current research.
Gong Lejun +4 more
doaj +2 more sources
Overlap matrix completion for predicting drug-associated indications. [PDF]
PLoS Computational Biology, 2019 Identification of potential drug-associated indications is critical for either approved or novel drugs in drug repositioning. Current computational methods based on drug similarity and disease similarity have been developed to predict drug-disease ...
Mengyun Yang +4 more
doaj +2 more sources
EMCMDA: predicting miRNA-disease associations via efficient matrix completion [PDF]
Scientific ReportsAbundant researches have consistently illustrated the crucial role of microRNAs (miRNAs) in a wide array of essential biological processes. Furthermore, miRNAs have been validated as promising therapeutic targets for addressing complex diseases.
Chao Qin, Jiancheng Zhang, Lingyu Ma
doaj +2 more sources
Linear Algebra and Its Applications, 2003 An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors prove that a combinatorially symmetric partial \(N\)-matrix has an \(N\)-matrix completion if the graph of its specified entries is a 1-chordal graph.
Ana Maria Urbano, Juan R Torregrosa
exaly +4 more sources
Prediction of circRNA-disease associations based on inductive matrix completion [PDF]
BMC Medical Genomics, 2020 Background Currently, numerous studies indicate that circular RNA (circRNA) is associated with various human complex diseases. While identifying disease-related circRNAs in vivo is time- and labor-consuming, a feasible and effective computational method ...
Menglu Li +3 more
doaj +2 more sources
The Q0-matrix completion problem [PDF]
Arab Journal of Mathematical Sciences, 2021 A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and
Kalyan Sinha
doaj +1 more source
Quaternion Matrix Factorization for Low-Rank Quaternion Matrix Completion
Mathematics, 2023 The main aim of this paper is to study quaternion matrix factorization for low-rank quaternion matrix completion and its applications in color image processing.
Jiang-Feng Chen +3 more
doaj +1 more source
Advances in Neural Information Processing Systems 36, 2023 The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy can be drastically different over different entries.
Elad Hazan +4 more
openaire +4 more sources