16430 search results - page 93 / 3286 » On Computable Tree Functions |
144
Voted
BMCBI
2002
15 years 3 months ago
2002
Background: When analyzing protein sequences using sequence similarity searches, orthologous sequences (that diverged by speciation) are more reliable predictors of a new protein&...
118
click to vote
DCC
1998
IEEE
15 years 7 months ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
118
click to vote
JOBIM
2000
15 years 7 months ago
2000
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...
90
Voted
EUROPAR
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
150
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...