1381 search results - page 88 / 277 » Structural signatures for tree data structures |
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
195
click to vote
RECOMB
2011
Springer
14 years 20 days ago
2011
Springer
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
SIGMETRICS
2004
ACM
15 years 3 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
SAC
2005
ACM
15 years 3 months ago
2005
ACM
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...