𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays

✍ Scribed by Wing-Kai Hon; Tak-Wah Lam; Kunihiko Sadakane; Wing-Kin Sung; Siu-Ming Yiu

Publisher
Springer
Year
2007
Tongue
English
Weight
196 KB
Volume
48
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Time-space trade-offs for compressed suf
Time-space trade-offs for compressed suffix arrays
✍ S.Srinivasa Rao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 70 KB

Given a binary string of length n, we give a representation of its suffix array that takes O(nt (lg n) 1/t ) bits of space such that given i, 1 i n, the ith entry in the suffix array of the string can be retrieved in O(t) time, for any parameter 1 t lg lg n. For t = lg lg n, this gives a compressed

A simple and space-efficient fragment-ch
A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
✍ B. Morgenstern πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 534 KB

In the segment-based approach to sequence alignment. nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candidate fragments and a weighting function w : F + FL:, the score of an alignment is de