2104 search results - page 80 / 421 » Sorting with networks of data structures |
128
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
157
click to vote
ALENEX
2009
15 years 5 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
106
Voted
PSB
2008
15 years 5 months ago
2008
bstracts in the structure prior of a Bayesian network could improve the prediction of the prognosis in cancer. Our results show that prediction of the outcome with the text prior w...
121
click to vote
ILP
2005
Springer
15 years 9 months ago
2005
Springer
We introduce a novel method for relational learning with neural networks. The contributions of this paper are threefold. First, we introduce the concept of relational neural networ...
157
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...