Sciweavers

11211 search results - page 289 / 2243
» Rank-Sensitive Data Structures
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
Tree-structure lossless coding using intervector angle
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
Jun Rokui
BMCBI
2008
117views more  BMCBI 2008»
15 years 6 months ago
RNACompress: Grammar-based compression and informational complexity measurement of RNA secondary structure
Background: With the rapid emergence of RNA databases and newly identified non-coding RNAs, an efficient compression algorithm for RNA sequence and structural information is neede...
Qi Liu, Yu Yang, Chun Chen, Jiajun Bu, Yin Zhang, ...
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
15 years 10 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
SIGKDD
2000
150views more  SIGKDD 2000»
15 years 6 months ago
KDD-Cup 2000 Organizers' Report: Peeling the Onion
We describe KDD-Cup 2000, the yearly competition in data mining. For the first time the Cup included insight problems in addition to prediction problems, thus posing new challenge...
Ron Kohavi, Carla E. Brodley, Brian Frasca, Llew M...
CSB
2003
IEEE
176views Bioinformatics» more  CSB 2003»
15 years 12 months ago
3D Structural Homology Detection via Unassigned Residual Dipolar Couplings
Recognition of a protein’s fold provides valuable information about its function. While many sequence-based homology prediction methods exist, an important challenge remains: tw...
Christopher James Langmead, Bruce Randall Donald