A parallel classification method of RNA sequences based on non-negative matrix factorization
A technology of non-negative matrix decomposition and classification method, which is applied in the field of parallel classification of RNA sequences based on non-negative matrix decomposition, which can solve problems such as lagging of bioinformatics tools, improve classification accuracy, improve operating efficiency, and shorten the required time Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] The RNA sequence parallel classification method based on non-negative matrix decomposition of the present invention, the concrete steps are as follows:
[0037] 1) Matrix RNA data:
[0038] Most somatic mutations include single base substitutions, insertions and deletions, rearrangements and copy number variations (CNVs). Single base substitutions belong to one of six possible base changes, namely C:G>A:T, C:G>G:C, C:G>T:A, T:A>A:T, T: A>C:G and T:A>G:C. The set can be further expanded by including the 5' and 3' adjacent bases of each substitution site, resulting in the letter A with 96 trinucleotide mutation types. Once A is correctly defined, the counts of mutations found in G different genomes are assembled into a K×G matrix M with K=A. A key assumption consists in treating the counts in M as the additive effect of N mutational processes, each defined as a K × 1 vector of mutation rates. The latter defines the so-called mutation signature. More precisely, muta...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


