Sciweavers

2192 search results - page 57 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
14 years 1 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
BIODATAMINING
2008
85views more  BIODATAMINING 2008»
13 years 8 months ago
A review of estimation of distribution algorithms in bioinformatics
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...
Rubén Armañanzas, Iñaki Inza,...
BMCBI
2006
110views more  BMCBI 2006»
13 years 8 months ago
Design of a combinatorial DNA microarray for protein-DNA interaction studies
Background: Discovery of precise specificity of transcription factors is an important step on the way to understanding the complex mechanisms of gene regulation in eukaryotes. Rec...
Julian Mintseris, Michael B. Eisen
JCB
2006
215views more  JCB 2006»
13 years 8 months ago
Protein Fold Recognition Using Segmentation Conditional Random Fields (SCRFs)
Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation con...
Yan Liu 0002, Jaime G. Carbonell, Peter Weigele, V...
CVPR
2007
IEEE
14 years 10 months ago
In Situ Evaluation of Tracking Algorithms Using Time Reversed Chains
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
Hao Wu, Aswin C. Sankaranarayanan, Rama Chellappa