2626 search results - page 170 / 526 » The complexity of stochastic sequences |
193
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
202
click to vote
BIBE
2008
IEEE
16 years 29 days ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
184
click to vote
ACCV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
167
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...
157
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...