Abstract
A central problem in computational biology is analyzing genetic sequences to determine the structures of the molecules (RNAs, proteins) they code for. Since this problem is analogous to the problem in computational linguistics of describing what structural descriptions are specified by a given utterance, as first observed by Searls [120], many researchers have tried using formal grammars to analyze biological sequences as well [109, 1, 127, 106]. In this chapter we will attempt a synthesis of this family of approaches, and investigate what properties of formal grammars will determine their success.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chiang, D. (2012). Biological Sequence Analysis: Basics. In: Grammars for Language and Genes. Theory and Applications of Natural Language Processing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20444-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-20444-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20443-2
Online ISBN: 978-3-642-20444-9
eBook Packages: Computer ScienceComputer Science (R0)