Searching and indexing genomic databases via kernelization

Frontiers in Bioengineering and Biotechnology

Volumn 3, Issue FEB, 2015, Pages

  Gagie, Travis ^a   Puglisi, Simon J ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Approximate pattern matching; Data compression; Genomic databases; Indexing; Kernelization; Random access reading; String algorithms

Indexed keywords

EID: 84966445773     PISSN: None     EISSN: 22964185     Source Type: Journal    
DOI: 10.3389/fbioe.2015.00012     Document Type: Short Survey

References (36)

1. Arroyuelo, D., Navarro, G., and Sadakane, K. (2012). Stronger Lempel-Ziv based compressed text indexing. Algorithmica 62, 54-101. doi: 10.1007/s00453-010-9443-8.
2. Bille, P., Fagerberg, R., and Gørtz, I. L. (2009). Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Trans. Algorithms 6:3. doi:10.1145/1644015.1644018.
3. Bille, P., Landau, G. M., Raman, R., Sadakane, K., Satti, S. R., and Weimann, O. (2011). "Random access to grammar-compressed strings," in Proceedings of the 22nd Symposium on Discrete Algorithms (SODA) (Philadephia: Society for Industrial and Applied Mathematics (SIAM)), 373-389.
4. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., et al. (2005). The smallest grammar problem. IEEE Trans. Inf. Theory 51, 2554-2576. doi:10.1109/TIT.2005.850116.
5. Claude, F., and Navarro, G. (2012). "Improved grammar-based compressed indexes," in Proceedings of the 19th Symposium on String Processing and Information Retrieval (SPIRE) (Berlin: Springer-Verlag), 180-192.
6. Cormode, G., and Muthukrishnan, S. (2007). The string edit distance matching problem with moves. ACM Trans. Algorithms 3:2. doi:10.1145/1186810.1186812.
7. Danek, D. A., Deorowicz, S., and Grabowski, S. (2014). Indexes of large genome collections on a PC. PLoS ONE 9:e109384. doi:10.1371/journal.pone.0109384.
8. Deorowicz, S., and Grabowski, S. (2011). Robust relative compression of genomes with random access. Bioinformatics 27, 2979-2986. doi:10.1093/bioinformatics/btr505.
9. Do, H. H., Jansson, J., Sadakane, K., and Sung, W. K. (2014). Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comp. Sci. 532, 14-30. doi:10.1016/j.tcs.2013.07.024.
10. Farach, M., and Thorup, M. (1998). String matching in Lempel-Ziv compressed strings. Algorithmica 20, 388-404. doi:10.1007/PL00009202.
11. Ferrada, H., Gagie, T., Gog, S., and Puglisi, S. J. (2014a). "Relative Lempel-Ziv with constant-time random access," in Proceedings of the 21st Symposium on String Processing and Information Retrieval (SPIRE) (Berlin: Springer-Verlag), 13-17.
12. Ferrada, H., Gagie, T., Hirvola, T., and Puglisi, S. J. (2014b). Hybrid indexes for repetitive datasets. Philos. Trans. R. Soc. A 327, 2016. doi:10.1098/rsta.2013.0137.
13. Gagie, T., Gawrychowski, P., Kärkkäinen, J., Nekrich, Y., and Puglisi, S. J. (2014a). "LZ77-based self-indexing with faster pattern matching," in Proceedings of the 11th Latin American Symposium on Theoretical Informatics (LATIN) (Berlin: Springer-Verlag), 731-742.
14. Gagie, T., Gawrychowski, P., and Puglisi, S. J. (2014b). Faster approximate pattern matching in compressed repetitive texts. J. Discrete Algorithms. doi:10.1016/j.jda.2014.10.003.
15. Gagie, T., Hoobin, C., and Puglisi, S. J. (2014c). "Block graphs in practice," in Proceedings of the 2nd International Conference on Algorithms for Big Data (ICABD) (Aachen: CEUR-WS.org), 30-36.
16. Gagie, T., Gawrychowski, P., and Puglisi, S. J. (2011). "Faster approximate pattern matching in compressed repetitive texts," in Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC) (Berlin: Springer-Verlag), 653-662.
17. Kärkkäinen, J., and Sutinen, E. (1998). Lempel-Ziv index for q-grams. Algorithmica 21, 137-154. doi:10.1007/PL00009205.
18. Kärkkäinen, J., and Ukkonen, E. (1996). "Lempel-Ziv parsing and sublinear-size index structures for string matching," in Proceedings of the 3rd South American Workshop on String Processing (WSP) (Ottawa: Carleton University Press), 141-155.
19. Karpinski, M., Rytter, W., and Shinohara, A. (1997). An efficient pattern-matching algorithm for strings with short descriptions. Nordic J. Comput. 4, 172-186.
20. Kreft, S., and Navarro, G. (2013). On compressing and indexing repetitive sequences. Theor. Comp. Sci. 483, 115-133. doi:10.1016/j.tcs.2012.02.006.
21. Kuruppu, S., Beresford-Smith, B., Conway, T. C., and Zobel, J. (2012). Iterative dictionary construction for compression of large DNA data sets. IEEE/ACM Trans. Comput. Biol. Bioinform. 9, 137-149. doi:10.1109/TCBB.2011.82.
22. Kuruppu, S., Puglisi, S. J., and Zobel, J. (2010). "Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval," in Proceedings of the 17th Symposium on String Processing and Information Retrieval (SPIRE) (Berlin: Springer-Verlag), 201-206.
23. Kuruppu, S., Puglisi, S. J., and Zobel, J. (2011). "Reference sequence construction for relative compression of genomes," in Proceedings of the 18th Symposium on String Processing and Information Retrieval (SPIRE) (Berlin: Springer-Verlag), 420-425.
24. Larsson, N. J., and Moffat, A. (1999). "Offline dictionary-based compression," in Proceedings of the Data Compression Conference (DCC) (Hoboken, NJ: IEEE Press), 296-305.
25. Maruyama, S., Nakahara, M., Kishiue, N., and Sakamoto, H. (2013). ESP-index: a compressed index based on edit-sensitive parsing. J. Discrete Algorithms 18, 100-112. doi:10.1016/j.jda.2012.07.009.
26. Maruyama, S., and Tabei, Y. (2014). "Fully online grammar compression in constant space," in Proceedings of the Data Compression Conference (DCC) (Hoboken, NJ: IEEE Press), 173-182.
27. Rahn, R., Weese, D., and Reinert, K. (2014). Journaled string tree-a scalable data structure for analyzing thousands of similar genomes on your laptop. Bioinformatics 30, 3499-3505. doi:10.1093/bioinformatics/btu438.
28. Rytter, W. (2003). Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comp. Sci. 302, 211-222. doi:10.1016/S0304-3975(02)00777-6.
29. Schneeberger, K., Hagmann, J., Ossowski, S., Warthmann, N., Gesing, S., Kohlbacher, O. D., et al. (2009). Simultaneous alignment of short reads against multiple genomes. Genome Biol. 10, R98. doi:10.1186/gb-2009-10-9-r98.
30. Takabatake, Y., Tabei, Y., and Sakamoto, H. (2014). "Improved ESP-index: a practical self-index for highly repetitive texts," in Proceedings of the 13th Symposium on Experimental Algorithms (SEA) (Berlin: Springer-Verlag), 338-350.
31. Verbin, E., and Yu, W. (2013). "Data structure lower bounds on random access to grammar-compressed strings," in Proceedings of the 24th Symposium on Combinatorial Pattern Matching (CPM) (Berlin: Springer-Verlag), 247-258.
32. Vyverman, M., Baets, B. D., Fack, V., and Dawyndt, P. (2012). Prospects and limitations of full-text index structures in genome analysis. Nucleic Acids Res. 40, 6993-7015. doi:10.1093/nar/gks408.
33. Wandelt, S., and Leser, U. (2012). "String searching in referentially compressed genomes," in Proceedings of the Conference on Knowledge Discovery and Information Retrieval (KDIR) (SciTePress), 95-102.
34. Wandelt, S., Starlinger, J., Bux, M., and Leser, U. (2013). "RCSI: scalable similarity search in thousand(s) of genomes," in Proceedings of the VLDB Endowment, Vol. 6 (San Jose, CA: VLDB Endowment), 1534-1545. doi:10.14778/2536258.2536265.
35. Ziv, J., and Lempel, A. (1977). A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23, 337-343. doi:10.1109/83.663496.
36. Ziv, J., and Lempel, A. (1978). Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24, 530-536. doi:10.1109/TIT.1978.1055911.