Searching for "Space Efficient Suffix Trees." – sorted by Relevance.
-
Space Efficient Suffix Trees
- Space Efficient Suffix Trees Ian Munro 1 , Venkatesh Raman 2 , S. Srinivasa Rao 2 1
- Cited by 33 (3 self) – Add To MetaCart
-
Efficient Implementation of Lazy Suffix Trees
- -only top-down construction for suffix trees. Our implementation is based on a new, space-efficient
- Cited by 29 (4 self) – Add To MetaCart
-
A space-efficient construction of the Burrows Wheeler transform for genomic data. submitted to
- the most space-efficient suffix tree implementation in use [9] uses about 100 bits per character, the most
- Cited by 1 (0 self) – Add To MetaCart
-
CPS-tree: A compact partitioned suffix tree for disk-based indexing on large genome sequences
- , especially in the domain of bioinformatics. Suffix tree allows for efficient pattern search with time
- Cited by 1 (0 self) – Add To MetaCart
-
Adaptive query processing for time-series data
- in a larger and less space-efficient suffix tree. max 63% 53% 43% 33% 23% 13% 3% -7% .17% -27% -31% min
- Cited by 24 (0 self) – Add To MetaCart
-
A.: Fully-compressed suffix trees
- the human genome requires 700 Megabytes, while even a space-efficient suffix tree on it requires at least 40
- Cited by 4 (4 self) – Add To MetaCart

