170 search results - page 34 / 34 » Algorithms on Compressed Strings and Arrays |
RECOMB
2005
Springer
14 years 5 months ago
2005
Springer
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
JCB
2006
13 years 5 months ago
2006
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
CGF
2008
13 years 5 months ago
2008
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
CN
2004
13 years 5 months ago
2004
Intrusion detection is a surveillance problem of practical import that is well suited to wireless sensor networks. In this paper, we study the application of sensor networks to the...
IANDC
2008
13 years 5 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...