Sciweavers

2184 search results - page 385 / 437
» Relative Entropy and Statistics
Sort
View
RECOMB
2003
Springer
16 years 24 days ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...
RECOMB
2002
Springer
16 years 24 days ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
172
Voted
RECOMB
2001
Springer
16 years 24 days ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
97
Voted
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
16 years 24 days ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
101
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 24 days ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel