2022
DOI: 10.3389/fgene.2022.862272
|View full text |Cite
|
Sign up to set email alerts
|

NCP-BiRW: A Hybrid Approach for Predicting Long Noncoding RNA-Disease Associations by Network Consistency Projection and Bi-Random Walk

Abstract: Long non-coding RNAs (lncRNAs) play significant roles in the disease process. Understanding the pathological mechanisms of lncRNAs during the course of various diseases will help clinicians prevent and treat diseases. With the emergence of high-throughput techniques, many biological experiments have been developed to study lncRNA-disease associations. Because experimental methods are costly, slow, and laborious, a growing number of computational models have emerged. Here, we present a new approach using networ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 51 publications
(69 reference statements)
0
1
0
Order By: Relevance
“…Birandom walks are also available in MSF-UBRW, where the interaction between lncRNAs and diseases was reconstructed using WKNKN based on unbalanced birandom walks and used as a transfer matrix for the respective networks. Similar birandom walk methods are used in NCP-BiRW and lung cancer prediction . Although existing network propagation random walk algorithms can utilize the neighbor information on nodes, the experimental process is cumbersome, and the resulting association scores are relatively low.…”
Section: Introductionmentioning
confidence: 99%
“…Birandom walks are also available in MSF-UBRW, where the interaction between lncRNAs and diseases was reconstructed using WKNKN based on unbalanced birandom walks and used as a transfer matrix for the respective networks. Similar birandom walk methods are used in NCP-BiRW and lung cancer prediction . Although existing network propagation random walk algorithms can utilize the neighbor information on nodes, the experimental process is cumbersome, and the resulting association scores are relatively low.…”
Section: Introductionmentioning
confidence: 99%