Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
about
RefSelect: a reference sequence selection algorithm for planted (l, d) motif search.Efficient sequential and parallel algorithms for finding edit distance based motifs.An Entropy-Based Position Projection Algorithm for Motif Discovery.qPMS9: an efficient algorithm for quorum Planted Motif Search.SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets.
P2860
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
description
2014 nî lūn-bûn
@nan
2014年の論文
@ja
2014年学术文章
@wuu
2014年学术文章
@zh
2014年学术文章
@zh-cn
2014年学术文章
@zh-hans
2014年学术文章
@zh-my
2014年学术文章
@zh-sg
2014年學術文章
@yue
2014年學術文章
@zh-hant
name
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
@en
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
@nl
type
label
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
@en
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
@nl
prefLabel
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
@en
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
@nl
P1476
Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
@en
P2093
Shunji Tanaka
P304
P356
10.1109/TCBB.2014.2306842
P577
2014-03-01T00:00:00Z