69 search results - page 10 / 14 » Merkle Tree Traversal in Log Space and Time |
RECOMB
2009
Springer
14 years 8 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
COCOON
1998
Springer
14 years 1 days ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
SIGGRAPH
1999
ACM
14 years 5 days ago
1999
ACM
Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple referenc...