Sciweavers

22018 search results - page 4148 / 4404
» or 2004
Sort
View
CPM
2004
Springer
145views Combinatorics» more  CPM 2004»
16 years 1 days ago
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs
The perfect phylogeny model for haplotype evolution has been successfully applied to haplotype resolution from genotype data. In this study we explore the application of the perfe...
Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, It...
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
16 years 1 days ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
16 years 1 days ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
16 years 1 days ago
On the k-Closest Substring and k-Consensus Pattern Problems
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
Yishan Jiao, Jingyi Xu, Ming Li
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
16 years 1 days ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
« Prev « First page 4148 / 4404 Last » Next »