Sciweavers

20813 search results - page 4055 / 4163
» Introduction to Computer Networking
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
15 years 2 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
BMCBI
2006
129views more  BMCBI 2006»
15 years 2 months ago
A literature-based similarity metric for biological processes
Background: Recent analyses in systems biology pursue the discovery of functional modules within the cell. Recognition of such modules requires the integrative analysis of genome-...
Monica Chagoyen, Pedro Carmona-Saez, Concha Gil, J...
BMCBI
2006
113views more  BMCBI 2006»
15 years 2 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
BMCBI
2007
148views more  BMCBI 2007»
15 years 2 months ago
fREDUCE: Detection of degenerate regulatory elements using correlation with expression
Background: The precision of transcriptional regulation is made possible by the specificity of physical interactions between transcription factors and their cognate binding sites ...
Randy Z. Wu, Christina Chaivorapol, Jiashun Zheng,...
IANDC
2006
121views more  IANDC 2006»
15 years 2 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
« Prev « First page 4055 / 4163 Last » Next »