Skip to main content
SpringerLink
Log in

Index Structures for Biological Sequences

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Database Systems

  • 10 Accesses

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 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Altschul S, Gish W, Miller W, Meyers EW, Lipman DJ. Basic local alignment search tool. J Mol Biol. 1990;215(3):403–10.

    Article  Google Scholar 

  2. Benson D, Karsch-Mizrachi I, Lipman D, Ostell J, Rapp B, Wheeler D. GenBank. Nucleic Acids Res. 2000;28(1):15–8.

    Article  Google Scholar 

  3. Bray N, Dubchak I, Pachter L. AVID: a global alignment program. Genome Res. 2003;13(1):97–102.

    Article  Google Scholar 

  4. Ferragina P, Grossi R. The string B-tree: a new data structure for string search in external memory and its applications. J ACM. 1999;46(2):236–80.

    Article  MathSciNet  MATH  Google Scholar 

  5. Flho RFS, Traina AJM, Caetano Traina J, Faloutsos C. Similarity search without tears: the OMNI family of all-purpose access methods. In: Proceedings of the 17th International Conference on Data Engineering; 2001. p. 623–30.

    Google Scholar 

  6. Giladi E, Walker M, Wang J, Volkmuth W. SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size. Bioinformatics. 2002;18(6):873–7.

    Article  Google Scholar 

  7. Kahveci T, Singh A. An efficient index structure for string databases. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001. p. 351–60.

    Google Scholar 

  8. Manber U, Myers E. Suffix arrays: a new method for on-line string searches. SIAM J Comput. 1993;22(5):935–48.

    Article  MathSciNet  MATH  Google Scholar 

  9. McCreight E. A space-economical suffix tree construction algorithm. J ACM. 1976;23(2):262–72.

    Article  MathSciNet  MATH  Google Scholar 

  10. Pearson W, Lipman D. Improved tools for biological sequence comparison. Proc Natl Acad Sci. 1988;85(8):2444–8.

    Article  Google Scholar 

  11. Pol A, Kahveci T. Highly scalable and accurate seeds for subsequence alignment. In: Proceedings of the IEEE International Conference on Bioinformatics and Bioengineering; 2005.

    Google Scholar 

  12. Ukkonen E. On-line construction of suffix-trees. Algorithmica. 1995;14(3):249–60.

    Article  MathSciNet  MATH  Google Scholar 

  13. Venkateswaran J, Lachwani D, Kahveci T, Jermaine C. Reference-based indexing for metric spaces with costly distance measures. VLDB J. 2008;17(5):1231–51.

    Article  Google Scholar 

  14. Weiner P. Linear pattern matching algorithms. In: Proceedings of the IEEE Symposium on Switching and Automata Theory; 1973. p. 1–11.

    Google Scholar 

  15. Yianilos P. Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms; 1993. p. 311–21.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Florida, Gainesville, FL, USA

    Tamer Kahveci

Authors
  1. Tamer Kahveci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tamer Kahveci .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. Robert H. Smith School of Business, University of Maryland, College Park, MD, USA

    Louiqa Raschid

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Kahveci, T. (2018). Index Structures for Biological Sequences. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1434

Download citation

Publish with us

Policies and ethics

Search

Navigation