solve a given problem
introduction
In bioinformatics, k-mers are substrings of length k contained within a biological sequence. Primarily used within the context of computational genomics and sequence analysis, during which k-mers are composed of nucleotides (i.e. A, T, G, and C), k-mers are capitalized upon to assemble DNA sequences, improve heterologous organic phenomenon ,identify species in metagenomic samples,and create attenuated vaccines.Usually, the term k-mer refers to all or any of a sequence's subsequences of length k, such the sequence AGAT would have four monomers (A, G, A, and T), three 2-mers (AG, GA, AT), two 3-mers (AGA and GAT) and one 4-mer (AGAT). More generally, a sequence of length L will have L-k+1} L-k+1 k-mers and total possible k-mers, where n is number of possible monomers (e.g. four within the case of DNA).
Step by step
Solved in 2 steps
