Compressed indexes for approximate string matching
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Chan, H.-L., Lam, T.-W., Sung, W.-K., Tam, S.-L., Wong, S.-S. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/42090 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Compressed indexes for approximate string matching
by: Chan, H.-L., 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) -
Approximate string matching using compressed suffix arrays
by: Huynh, T.N.D., et al.
Published: (2013) -
Space efficient indexes for string matching with don't cares
by: Lam, T.-W., et al.
Published: (2013)