A space and time efficient algorithm for constructing compressed suffix arrays
10.1007/s00453-006-1228-8
Saved in:
Main Authors: | Hon, W.-K., Lam, T.-W., Sadakane, K., Sung, W.-K., Yiu, S.-M. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39846 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Constructing compressed suffix arrays with large alphabets
by: Hon, W.-K., et al.
Published: (2013) -
Breaking a time-and-space barrier in constructing full-text indices
by: Hon, W.-K., et al.
Published: (2013) -
Approximate string matching using compressed suffix arrays
by: Huynh, T.N.D., et al.
Published: (2013) -
Compressed indexes for approximate string matching
by: Chan, H.-L., et al.
Published: (2013) -
Practical aspects of compressed suffix arrays and FM-index in searching DNA sequences
by: Hon, W.-K., et al.
Published: (2013)