34 search results - page 1 / 7 » New Bounds for Motif Finding in Strong Instances |
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
BMCBI
2007
13 years 5 months ago
2007
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...
BMCBI
2007
13 years 5 months ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We present new, general-purpose kernels for protein structure analysis, and describe how to apply them to structural motif discovery and function classification. Experiments show ...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...