2021
DOI: 10.21203/rs.3.rs-770358/v1
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Improved Fuzzy Cognitive Maps for Gene Regulatory Networks Inference Based on Time Series Data

Abstract: Recently with the advancement of high-throughput sequencing, gene regulatory network inference has turned into an interesting subject in bioinformatics and system biology. But there are many challenges in the field such as noisy data, uncertainty, time-series data with numerous gene numbers and low data, time complexity and so on. In recent years, many research works have been conducted to tackle these challenges, resulting in different methods in gene regulatory networks inference. A number of models have bee… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 43 publications
0
0
0
Order By: Relevance
“…Therefore, in this research, we used F-score, Structural Accuracy, and MCC as performance evaluation measurements. In addition, SS_mean, a sensitivity specificity-based measure, was also used, since the results of most of the fuzzy concepts-based models for GRN inference are reported in terms of SS_mean [33][34][35]49].…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Therefore, in this research, we used F-score, Structural Accuracy, and MCC as performance evaluation measurements. In addition, SS_mean, a sensitivity specificity-based measure, was also used, since the results of most of the fuzzy concepts-based models for GRN inference are reported in terms of SS_mean [33][34][35]49].…”
Section: Resultsmentioning
confidence: 99%
“…The time complexity of CS-FCM is O(n 3 MI) as reported in [34], where n is the number of nodes (genes) in FCM, M is the number of iterations for data sequences, and I is the number of iterations required for CS-FCM for optimal results. Based on the design of LAS-SO-FCM, and KFCSFCM, each method requires approximately the same computational time as CS-FCM, as demonstrated in experiments [33][34][35]. Thus, the required time complexity of these considered FCM-based methods can be simplified as O(n 3 MI).…”
Section: Plos Onementioning
confidence: 99%
See 2 more Smart Citations