Multi-omics integration with weighted affinity and self-diffusion applied for cancer subtypes identification.

BACKGROUND: Characterizing cancer molecular subtypes is crucial for improving prognosis and individualized treatment. Integrative analysis of multi-omics data has become an important approach for disease subtyping, yielding better understanding of the complex biology. Current multi-omics integration tools and methods for cancer subtyping often suffer challenges of high computational efficiency as well as the problem of weight assignment on data types. RESULTS: Here, we present an efficient multi-omics integration via weighted affinity and self-diffusion (MOSD) to dissect cancer heterogeneity. MOSD first construct local scaling affinity on each data type and then integrate all affinities by weighted linear combination, followed by the self-diffusion to further improve the patients' similarities for the downstream clustering analysis. To demonstrate the effectiveness and usefulness for cancer subtyping, we apply MOSD across ten cancer types with three measurements (Gene expression, DNA methylation, miRNA). CONCLUSIONS: Our approach exhibits more significant differences in patient survival and computationally efficient benchmarking against several state-of-art integration methods and the identified molecular subtypes reveal strongly biological interpretability. The code as well as its implementation are available in GitHub: https://github.com/DXCODEE/MOSD .

A modified shuffled frog leaping algorithm with inertia weight.

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems.