✳flâneur — a map of the web's best reading

k-mer - Wikipedia

en.wikipedia.org · 6,981 words · saved by 2 readers

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, in which k-mers are composed of nucleotides (i.e. A, T, G, and C), k-mers are capitalized upon to assemble DNA sequences,[1] improve heterologous gene expression,[2][3] identify species in metagenomic samples,[4] and create attenuated vaccines.[5] Usually, the term k-mer refers to all of a sequence's subsequences of length k , such that 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 k-mers and nk total possible k-mers, where n is number of possible monomers (e.g. four in the case of DNA).

k-mer - Wikipedia Jump to content From Wikipedia, the free encyclopedia Substrings of length k contained in a biological sequence For broader coverage of this topic, see n-gram . The sequence ATGG has two 3-mers: ATG and TGG. In bioinformatics , k -mers are substrings of length k {\displaystyle k} contained within a biological sequence. Primarily used within the context of computational genomics and sequence analysis , in which k -mers are composed of nucleotides ( i.e . A, T, G, and C), k -mers are capitalized upon to assemble DNA sequences , [ 1 ] improve heterologous gene expression

Explore this link on the map →

saved by

related reading