Fast relative Lempel-Ziv self-index for similar sequences

Theoretical Computer Science

Volumn 532, Issue , 2014, Pages 14-30

  Do, Huy Hoang ^a   Jansson, Jesper ^b   Sadakane, Kunihiko ^c   Sung, Wing Kin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b KYOTO UNIVERSITY   (Japan)

^c NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Exact pattern searching; FM index; Rank and select; String decomposition; Suffix range; Textual substitution

Indexed keywords

COMPRESSION SCHEME; EXACT PATTERN SEARCHING; FM-INDEX; RANK AND SELECT; STRUCTURE-BASED; SUB-STRINGS; SUFFIX RANGE; WEB TECHNOLOGIES;

EID: 85027945999     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2013.07.024     Document Type: Article

References (41)

1. The 1000 Genomes Project Consortium. A map of human genome variation from population-scale sequencing. Nature 2010, 467(7319):1061-1073.
2. Apostolico A., Lonardi S. Compression of biological sequences by greedy off-line textual substitution. DCC 2000, 143-152.
3. Arroyuelo D., Navarro G., Sadakane K. Reducing the space requirement of LZ-index. in CPM, in: LNCS 2006, vol. 4009:318-329.
4. Bille P., Landau G.M., Raman R., Sadakane K., Satti S.R., Weimann O. Random access to grammar-compressed strings. SODA 2011, 373-389.
5. Bose P., He M., Maheshwari A., Morin P. Succinct orthogonal range search structures on a grid with applications to text indexing. in: WADS, in: LNCS 2009, vol. 5664:98-109.
6. Cao M.D., Dix T.I., Allison L., Mears C. A simple statistical algorithm for biological sequence compression. DCC 2007, 43-52.
7. Chan T.M., Larsen K.G., Paˇtras¸cu M. Orthogonal range searching on the RAM, revisited. SoCG 2011, 1-10.
8. Chen X., Kwong S., Li M. A compression algorithm for DNA sequences and its applications in genome comparison. RECOMB 2000, 107.
9. Christley S., Lu Y., Li C., Xie X. Human genomes as email attachments. Bioinformatics 2009, 25(2):274-275.
10. Claude F., Navarro G. Self-indexed text compression using straight-line programs. in: MFCS, in: LNCS 2009, vol. 5734:235-246.
11. Delpratt O., Rahman N., Raman R. Compressed prefix sums. SOFSEM 2007.
12. Ferragina P., Manzini G. Compression boosting in optimal linear time using the Burrows-Wheeler Transform. SODA 2004, 655-663.
13. Ferragina P., Manzini G. Indexing compressed text. Journal of the ACM 2005, 52(4):552-581.
14. Fischer J. Wee LCP. Information Processing Letters 2010, 110:317-320.
15. Fischer J. Combined data structure for previous- and next-smaller-values. Theoretical Computer Science 2011, 412:2451-2456.
16. Fischer J., Heun V. A new succinct representation of RMQ-information and improvements in the enhanced suffix array. in: ESCAPE, in: LNCS 2007, vol. 4614:459-470.
17. Gagie T., Gawrychowski P., Ka¨rkka¨inen J., Nekrich Y., Puglisi S.J. A faster grammar-based self-index. in: LATA, in: LNCS 2012, vol. 7183:240-251. Springer.
18. Golynski A., Munro J.I., Rao S.S. Rank/select operations on large alphabets: a tool for text indexing. SODA 2006, 368-373.
19. Grossi R., Gupta A., Vitter J.S. High-order entropy-compressed text indexes. SODA 2003, 841-850. SIAM.
20. Grumbach S., Tahi F. Compression of DNA sequences. DCC 1993, 340-350.
21. Huang S., Lam T.W., Sung W.-K., Tam S.-L., Yiu S.-M. Indexing similar DNA sequences. in: AAIM, in: LNCS 2010, vol. 6124:180-190.
22. Kreft S., Navarro G. LZ77-like compression with fast random access. DCC 2010, 239-248.
23. Kreft S., Navarro G. Self-indexing based on LZ77. in: CPM, in: LNCS 2011, vol. 6661:41-54.
24. S. Kuruppu, B. Beresford-Smith, T. Conway, J. Zobel, Repetition-based compression of large DNA datasets, 2009, Poster at RECOMB.
25. Kuruppu S., Puglisi S.J., Zobel J. Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. in: SPIRE, in: LNCS 2010, vol. 6393:201-206.
26. Kuruppu S., Puglisi S.J., Zobel J. Reference sequence construction for relative compression of genomes. in: SPIRE, in: LNCS 2011, vol. 7024:420-425.
27. Lam T.W., Li R., Tam A., Wong S., Wu E., Yiu S.M. High throughput short read alignment via bi-directional BWT. BIBM 2009, 31-36. IEEE.
28. Larsson N.J., Moffat A. Offline dictionary-based compression. DCC 1999, 296-305.
29. Ma¨kinen V., Navarro G. Implicit compression boosting with applications to self-indexing. in: SPIRE, in: LNCS 2007, vol. 4726:229-241.
30. Ma¨kinen V., Navarro G., Sire´n J., Va¨lima¨ki N. Storage and retrieval of highly repetitive sequence collections. Journal of Computational Biology 2010, 17(3):281-308.
31. Muthukrishnan S. Efficient algorithms for document retrieval problems. SODA 2002, 657-666.
32. Navarro G., Ma¨kinen V. Compressed full-text indexes. ACM Computing Surveys 2007, 39(1).
33. Paˇtras¸cu M. Succincter. FOCS 2008, 305-313.
34. Rivals E., Delahaye J.-P., Dauchet M., Delgrange O. A guaranteed compression scheme for repetitive DNA sequences. DCC 1996, 453.
35. Russo L.M.S., Oliveira A.L. A compressed self-index using a Ziv-Lempel dictionary. in: SPIRE, in: LNCS 2006, vol. 4209:163-180.
36. Rytter W. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science 2003, 302:211-222.
37. Sadakane K. Compressed suffix trees with full functionality. Theory of Computing Systems 2007, 41:589-607.
38. Schneeberger K., Hagmann J., Ossowski S., Warthmann N., Gesing S., Kohlbacher O., Weigel D. Simultaneous alignment of short reads against multiple genomes. Genome Biology 2009, 10:1-12.
39. Sire´n J., Va¨lima¨ki N., Ma¨kinen V., Navarro G. Run-length compressed indexes are superior for highly repetitive sequence collections. in: SPIRE, in: LNCS 2008, vol. 5280:164-175.
40. Willard D.E. Log-logarithmic worst-case range queries are possible in space Θ(N). Information Processing Letters 1983, 17(2):81-84.
41. Ziv J., Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 1977, 23(3):337-343.