Skip to main content
SpringerLink
Log in

Relative Select

  • Conference paper
  • First Online:
String Processing and Information Retrieval (SPIRE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9309))

Included in the following conference series:

  • International Symposium on String Processing and Information Retrieval

Abstract

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.

T. Gagie—Supported by grants 268324 and 250345 (CoECGR) from the Academy of Finland.

J. Siren—Supported by the Wellcome Trust grant 098051.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Boucher, C., Bowe, A., Gagie, T., Puglisi, S., Sadakane, K.: Variable-order de Bruijn graphs. In: Proc. DCC (2015)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  4. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Tech. Rep. 124, Digital Equipment Corporation (1994)

    Google Scholar 

  5. Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52, 552–581 (2005)

    Article  MathSciNet  Google Scholar 

  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. Idury, R., Waterman, M.: A new algorithm for DNA sequence assembly. J. Comput. Biol. 2, 291–306 (1995)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  9. Pevzner, P., Tang, H., Waterman, M.: An Eulerian path approach to DNA fragment assembly. Proc. Nat. Acad. Sci. 98, 9748–9753 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  11. Rozowsky, J., et al.: AlleleSeq: analysis of allele-specific expression and binding in a network framework. Molecular Systems Biology 7, 522 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Colorado State University, Fort Collins, CO, USA

    Christina Boucher

  2. National Institute of Informatics, Tokyo, Japan

    Alexander Bowe

  3. Helsinki Institute for Information Technology, University of Helsinki, Helsinki, Finland

    Travis Gagie

  4. University of Eastern Piedmont, Alessandria, Italy

    Giovanni Manzini

  5. Wellcome Trust Sanger Institute, Cambridge, UK

    Jouni Sirén

Authors
  1. Christina Boucher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Bowe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Travis Gagie
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Giovanni Manzini
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jouni Sirén
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giovanni Manzini .

Editor information

Editors and Affiliations

  1. King's College London, London, United Kingdom

    Costas Iliopoulos

  2. University of Helsinki, Helsinki, Finland

    Simon Puglisi

  3. University College London, London, United Kingdom

    Emine Yilmaz

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Boucher, C., Bowe, A., Gagie, T., Manzini, G., Sirén, J. (2015). Relative Select. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds) String Processing and Information Retrieval. SPIRE 2015. Lecture Notes in Computer Science(), vol 9309. Springer, Cham. https://doi.org/10.1007/978-3-319-23826-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23826-5_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23825-8

  • Online ISBN: 978-3-319-23826-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation