Efficient multi-omics clustering with bipartite graph subspace learning for cancer subtype prediction
Due to the complex nature and highly heterogeneous of cancer, as well as different pathogenesis and clinical features among different cancer subtypes, it was crucial to identify cancer subtypes in cancer diagnosis, prognosis, and treatment. The rapid developments of high-throughput technologies have...
Saved in:
Main Authors: | Shuwei Zhu, Hao Liu, Meiji Cui |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2024-11-01
|
Series: | Electronic Research Archive |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/era.2024279 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01) -
Algorithmic aspects of bipartite graphs
by: Mihály Bakonyi, et al.
Published: (1995-01-01) -
MO-GCN: A multi-omics graph convolutional network for discriminative analysis of schizophrenia
by: Haiyuan Wang, et al.
Published: (2025-02-01) -
Improving molecular subtypes and prognosis of pancreatic cancer through multi group analysis and machine learning
by: Xue-Jian Zhang, et al.
Published: (2025-01-01) -
𝕮-inverse of graphs and mixed graphs
by: Alomari Omar, et al.
Published: (2025-02-01)