Succinct Gapped Suffix Arrays

  • Luís M. S. Russo
  • German Tischler
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7024)

Abstract

Gapped suffix arrays (also known as bi-factor arrays) were recently presented for approximate searching under the Hamming distance. These structures can be used to find occurrences of a pattern P, where the characters inside a gap do not have to match. This paper describes a succinct representation of gapped suffix arrays.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report, Digital SRC Research Report (1994)Google Scholar
  2. 2.
    Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 pages. Cambridge University Press, Cambridge (2007)CrossRefMATHGoogle Scholar
  3. 3.
    Crochemore, M., Tischler, G.: The gapped suffix array: A new index structure for fast approximate matching. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 359–364. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: An alphabet-friendly FM-index. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol. 3246, pp. 150–160. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Gagie, T., Puglisi, S.J., Turpin, A.: Range quantile queries: Another virtue of wavelet trees. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 1–6. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841–850 (2003)Google Scholar
  7. 7.
    Jacobson, G.: Space-efficient Static Trees and Graphs. In: Foundations of Computer Science, pp. 549–554 (1989)Google Scholar
  8. 8.
    Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37–42. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  9. 9.
    Peterlongo, P., Allali, J., Sagot, M.-F.: Indexing gapped-factors using a tree. Int. J. Found. Comput. Sci. 19(1), 71–87 (2008)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Peterlongo, P., Pisanti, N., Boyer, F., Sagot, M.-F.: Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 179–190. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 40–50. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Luís M. S. Russo
    • 1
    • 2
  • German Tischler
    • 3
  1. 1.Instituto Superior Técnico-Universidade Técnica de Lisboa (IST/UTL)LisboaPortugal
  2. 2.INESC-ID, Knowledge Discovery and Bioinformatics GroupLisbonPortugal
  3. 3.Lehrstuhl für Informatik II, Universität WürzburgWürzburgGermany

Personalised recommendations