Full-text

|| Go to publishers' web page for final fulltext/PDF. (see the Authoritative link as below)

URL: http://www.santafe.edu/research/publicat...papers/07-08-016.pdf

Related links

Authoritative: http://dx.doi.org/10.1142/S0217979207045244   (Publisher's PDF... likely be available here.)

Web search: Google Web Search   ::   Google Scholar

Abstract

A formal language is called factorizable if any substring of a word in it also belongs to the language. Symbolic sequences from symbolic dynamics make factorizable languages by definition. In studying avoided and under-represented strings in bacterial genomes we have defined a factorizable language for each complete genome. Recently, in studying the problem of uniqueness of reconstruction of a protein sequence from its constituent K-peptides we encounter again factorizable language which helps to build a finite state automaton to recognize the uniqueness of reconstruction. We present a brief review of these applications of factorizable languages from dynamics to biology.

Keywords: Symbolic dynamics; formal language; proteins; DNA sequence

@article{hao07factorizableLanguage,
  author={Bailin Hao and Huimin Xie},
  title={Factorizable language revisited from dynamics to biology},
  journal={International Journal of Modern Physics B},
  year={2007},
  volume={21},
  number={23-24},
  pages={4077-4082},
  doi={10.1142/S0217979207045244},
  url={http://groups.lis.illinois.edu/amag/langev/paper/hao07factorizableLanguage.html},
  keywords={Symbolic dynamics; formal language; proteins; DNA sequence}
}