11 search results - page 2 / 3 » Expectations of Random Sets and Their Boundaries Using Orien... |
TIT
2010
12 years 11 months ago
2010
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
BMCBI
2007
13 years 4 months ago
2007
Background: Computational prediction methods are currently used to identify genes in prokaryote genomes. However, identification of the correct translation initiation sites remain...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
ALMOB
2006
13 years 4 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...