Sciweavers

460 search results - page 16 / 92
» Randomized Algorithms for Motif Detection
Sort
View
RECOMB
2008
Springer
14 years 9 months ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...
SPIRE
2009
Springer
14 years 1 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
BMCBI
2008
128views more  BMCBI 2008»
13 years 8 months ago
SIGffRid: A tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically drive
Background: Many programs have been developed to identify transcription factor binding sites. However, most of them are not able to infer two-word motifs with variable spacer leng...
Fabrice Touzain, Sophie Schbath, Isabelle Debled-R...
NIPS
2003
13 years 10 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
VLSID
1993
IEEE
136views VLSI» more  VLSID 1993»
14 years 22 days ago
A Simulation-Based Test Generation Scheme Using Genetic Algorithms
This paper discusses a Genetic Algorithm-based method of generating test vectorsfor detecting faults in combinational circuits. The GA-based approach combines the merits of two te...
M. Srinivas, Lalit M. Patnaik