International Symposium on String Processing and Information Retrieval

SPIRE 2015: String Processing and Information Retrieval pp 149-155 | Cite as

Relative Select

  • Christina Boucher
  • Alexander Bowe
  • Travis Gagie
  • Giovanni ManziniEmail author
  • Jouni Sirén
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9309)


Motivated by the problem of storing coloured de Bruijn graphs, we show how, if we can already support fast select queries on one string, then we can store a little extra information and support fairly fast select queries on a similar string.


Edit Distance Longe Common Subsequence Relative Select Similar String Wellcome Trust Sanger Institute 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Belazzougui, D., Gagie, T., Gog, S., Manzini, G., Sirén, J.: Relative FM-indexes. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 52–64. Springer, Heidelberg (2014) Google Scholar
  2. 2.
    Boucher, C., Bowe, A., Gagie, T., Puglisi, S., Sadakane, K.: Variable-order de Bruijn graphs. In: Proc. DCC (2015)Google Scholar
  3. 3.
    Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 225–235. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  4. 4.
    Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Tech. Rep. 124, Digital Equipment Corporation (1994)Google Scholar
  5. 5.
    Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52, 552–581 (2005)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326–337. Springer, Heidelberg (2014) Google Scholar
  7. 7.
    Idury, R., Waterman, M.: A new algorithm for DNA sequence assembly. J. Comput. Biol. 2, 291–306 (1995)CrossRefGoogle Scholar
  8. 8.
    Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de Bruijn graphs. Nature Genetics 44, 226–232 (2012)CrossRefGoogle Scholar
  9. 9.
    Pevzner, P., Tang, H., Waterman, M.: An Eulerian path approach to DNA fragment assembly. Proc. Nat. Acad. Sci. 98, 9748–9753 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Raman, R., Raman, V., Rao Satti, S.: Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3, 43 (2007)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Rozowsky, J., et al.: AlleleSeq: analysis of allele-specific expression and binding in a network framework. Molecular Systems Biology 7, 522 (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Christina Boucher
    • 1
  • Alexander Bowe
    • 2
  • Travis Gagie
    • 3
  • Giovanni Manzini
    • 4
    Email author
  • Jouni Sirén
    • 5
  1. 1.Colorado State UniversityFort CollinsUSA
  2. 2.National Institute of InformaticsTokyoJapan
  3. 3.Helsinki Institute for Information TechnologyUniversity of HelsinkiHelsinkiFinland
  4. 4.University of Eastern PiedmontAlessandriaItaly
  5. 5.Wellcome Trust Sanger InstituteCambridgeUK

Personalised recommendations