Sciweavers

1099 search results - page 187 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
BMCBI
2006
116views more  BMCBI 2006»
14 years 9 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...
BMCBI
2005
201views more  BMCBI 2005»
14 years 9 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota
TAMC
2007
Springer
15 years 3 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 7 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ICIC
2009
Springer
15 years 4 months ago
Function Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
Shixian Wang, Yuehui Chen, Peng Wu