Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-29700-7_27
Title: Fast relative Lempel-Ziv self-index for similar sequences
Authors: Do, H.H.
Jansson, J.
Sadakane, K.
Sung, W.-K. 
Issue Date: 2012
Source: Do, H.H.,Jansson, J.,Sadakane, K.,Sung, W.-K. (2012). Fast relative Lempel-Ziv self-index for similar sequences. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7285 LNCS : 291-302. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-29700-7_27
Abstract: Recent advances in biotechnology and web technology are generating huge collections of similar strings. People now face the problem of storing them compactly while supporting fast pattern searching. One compression scheme called relative Lempel-Ziv compression uses textual substitutions from a reference text as follows: Given a (large) set S of strings, represent each string in S as a concatenation of substrings from a reference string R. This basic scheme gives a good compression ratio when every string in S is similar to R, but does not provide any pattern searching functionality. Here, we describe a new data structure that supports fast pattern searching. © 2012 Springer-Verlag.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/40284
ISBN: 9783642296994
ISSN: 03029743
DOI: 10.1007/978-3-642-29700-7_27
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

14
checked on Dec 11, 2017

Page view(s)

67
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.