Synonyms
DNA sequences; Protein sequence
Definition
A biological sequence is a sequence with a small fixed alphabet, and represents a naturally occurring or experimental generated fragment of genetic or protein material or any intermediate product (like the messenger RNA).
Example: A DNA fragment has the 4 character alphabet ‘A’, ‘C’, ‘T’, ‘G’. Chromosomes are long strings over this alphabet.
Key Points
Biological sequences can be long. A full chromosome may have millions of characters. Therefore development of proper storing and indexing strategies is very important for fast retrieval. Suffix tree based indexes have been used successfully for long biological sequences. Further, approximate string matching techniques with potential deletions and insertions are important for biological sequences. BLAST is a well known algorithm used for approximate matching and ranking of biological sequences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Brown AL. Constructing genome scale suffix trees. In: Proceedings of the 2nd Asia-Pacific Bioinformatics Conference; 2004.
Hunt E, Atkinson MP, Irving RW. A database index to large biological sequences. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001. p. 139–48.
Phoophakdee B, Zaki MJ. TRELLIS +: an effective approach for indexing genome-scale sequences using suffix trees. In: Proceedings of the Pacific Symposium on Biocomputing (online proceedings); 2008. p. 90–101.
Tian Y, Tata S, Hankins RA, Patel JM. Practical methods for constructing suffix trees. VLDB J. 2005;14(3):281–99.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Gupta, A. (2018). 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_1307
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1307
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering