ロード中...

Identification of polymorphic motifs using probabilistic search algorithms

The problem of identifying motifs comprising nucleotides at a set of polymorphic DNA sites, not necessarily contiguous, arises in many human genetic problems. However, when the sites are not contiguous, no efficient algorithm exists for polymorphic motif identification. A search based on complete en...

詳細記述

保存先:
書誌詳細
主要な著者: Basu, Analabha, Chaudhuri, Probal, Majumder, Partha P.
フォーマット: Artigo
言語:Inglês
出版事項: Cold Spring Harbor Laboratory Press 2005
主題:
オンライン・アクセス:https://ncbi.nlm.nih.gov/pmc/articles/PMC540278/
https://ncbi.nlm.nih.gov/pubmed/15632091
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1101/gr.2358005
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!