7 search results - page 2 / 2 » A Characterization of NC by Tree Recurrence |
CPC
1999
13 years 8 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...