Sciweavers

1018 search results - page 200 / 204
» Generative unbinding of names
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 7 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
BMCBI
2005
97views more  BMCBI 2005»
13 years 7 months ago
Clustering the annotation space of proteins
Background: Current protein clustering methods rely on either sequence or functional similarities between proteins, thereby limiting inferences to one of these areas. Results: Her...
Victor Kunin, Christos A. Ouzounis
BMCBI
2005
127views more  BMCBI 2005»
13 years 7 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin
BMCBI
2005
106views more  BMCBI 2005»
13 years 7 months ago
SIMPROT: Using an empirically determined indel distribution in simulations of protein evolution
Background: General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis an...
Andy Pang, Andrew D. Smith, Paulo A. S. Nuin, Elis...
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang