翻訳と辞書 |
K-mer
The term ''k-mer'' typically refers to all the possible substrings of length k that are contained in a string. In computational genomics, k-mers refer to all the possible subsequences (of length k) from a read obtained through DNA Sequencing. The amount of k-mers possible given a string of length, L, is whilst the number of possible k-mers given n possibilities (4 in the case of DNA e.g. ACTG) is . K-mers are typically used during sequence assembly,〔Compeau, P., Pevzner, P. & Teslar, G. ''How to apply de Bruijn graphs to genome assembly”. Nature Biotechnology, 2011. .〕 but can also be used in sequence alignment. == Sequence Assembly==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「K-mer」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|