Sciweavers

24444 search results - page 4466 / 4889
» A Data Model for Data Integration
Sort
View
RECOMB
2004
Springer
16 years 7 months ago
Maximum likelihood resolution of multi-block genotypes
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
Gad Kimmel, Ron Shamir
RECOMB
2003
Springer
16 years 7 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
RECOMB
2003
Springer
16 years 7 months ago
A multi-expert system for the automatic detection of protein domains from sequence information
We describe a novel method for detecting the domain structure of a protein from sequence information alone. The method is based on analyzing multiple sequence alignments that are ...
Niranjan Nagarajan, Golan Yona
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 7 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
« Prev « First page 4466 / 4889 Last » Next »