Sciweavers

2192 search results - page 9 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
14 years 1 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
IJCAI
2007
13 years 9 months ago
Incremental Construction of Structured Hidden Markov Models
This paper presents an algorithm for inferring a Structured Hidden Markov Model (S-HMM) from a set of sequences. The S-HMMs are a sub-class of the Hierarchical Hidden Markov Model...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
BMCBI
2006
136views more  BMCBI 2006»
13 years 8 months ago
EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
Background: Understanding gene regulatory networks has become one of the central research problems in bioinformatics. More than thirty algorithms have been proposed to identify DN...
Jianjun Hu, Yifeng D. Yang, Daisuke Kihara
BMCBI
2006
95views more  BMCBI 2006»
13 years 8 months ago
XcisClique: analysis of regulatory bicliques
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. H...
ICML
1999
IEEE
14 years 8 months ago
Detecting Motifs from Sequences
The problemofmultipleglobalcomparisonin familiesof biologicalsequences has been wellstudied. Fewer algorithms have been developed for identifying local consensus patterns or motif...
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler