Constructing compressed suffix arrays with large alphabets
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Hon, W.-K., Lam, T.-W., Sadakane, K., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39713 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A space and time efficient algorithm for constructing compressed suffix arrays
by: Hon, W.-K., et al.
Published: (2013) -
Approximate string matching using compressed suffix arrays
by: Huynh, T.N.D., 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) -
Improved approximate string matching using compressed suffix data structures
by: Lam, T.-W., et al.
Published: (2013) -
Improved approximate string matching using compressed suffix data structures
by: Lam, T.-W., et al.
Published: (2013)