Sciweavers

736 search results - page 4 / 148
» Approximating the Number of Network Motifs
Sort
View
ADHOCNOW
2004
Springer
14 years 24 days ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
IEEEPACT
2005
IEEE
14 years 1 months ago
Exploiting Coarse-Grained Parallelism to Accelerate Protein Motif Finding with a Network Processor
While general-purpose processors have only recently employed chip multiprocessor (CMP) architectures, network processors (NPs) have used heterogeneous multi-core architectures sin...
Ben Wun, Jeremy Buhler, Patrick Crowley
BMCBI
2010
106views more  BMCBI 2010»
13 years 7 months ago
A computational evaluation of over-representation of regulatory motifs in the promoter regions of differentially expressed genes
Background: Observed co-expression of a group of genes is frequently attributed to co-regulation by shared transcription factors. This assumption has led to the hypothesis that pr...
Guofeng Meng, Axel Mosig, Martin Vingron
BMCBI
2005
106views more  BMCBI 2005»
13 years 7 months ago
A multistep bioinformatic approach detects putative regulatory elements in gene promoters
Background: Searching for approximate patterns in large promoter sequences frequently produces an exceedingly high numbers of results. Our aim was to exploit biological knowledge ...
Stefania Bortoluzzi, Alessandro Coppe, Andrea Biso...
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 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,...