Where Mathematics, Computer Science, Linguistics and Biology MeetSpringer Science & Business Media, 2001 - 446 strán (strany) In the last years, it was observed an increasing interest of computer scientists in the structure of biological molecules and the way how they can be manipulated in vitro in order to define theoretical models of computation based on genetic engineering tools. Along the same lines, a parallel interest is growing regarding the process of evolution of living organisms. Much of the current data for genomes are expressed in the form of maps which are now becoming available and permit the study of the evolution of organisms at the scale of genome for the first time. On the other hand, there is an active trend nowadays throughout the field of computational biology toward abstracted, hierarchical views of biological sequences, which is very much in the spirit of computational linguistics. In the last decades, results and methods in the field of formal language theory that might be applied to the description of biological sequences were pointed out. |
Obsah
III | 1 |
IV | 11 |
V | 13 |
VI | 25 |
VII | 37 |
VIII | 51 |
IX | 63 |
X | 75 |
XXVI | 227 |
XXVII | 237 |
XXVIII | 243 |
XXIX | 253 |
XXX | 267 |
XXXII | 277 |
XXXIII | 287 |
XXXIV | 297 |
XI | 85 |
XII | 97 |
XIII | 99 |
XIV | 115 |
XV | 127 |
XVI | 139 |
XVII | 149 |
XVIII | 161 |
XX | 173 |
XXI | 175 |
XXII | 187 |
XXIII | 199 |
XXIV | 211 |
XXV | 219 |
XXXV | 299 |
XXXVI | 319 |
XXXVII | 329 |
XXXVIII | 343 |
XXXIX | 353 |
XL | 361 |
XLI | 377 |
XLII | 387 |
XLIII | 399 |
XLIV | 409 |
XLV | 423 |
XLVI | 435 |
Iné vydania - Zobraziť všetky
Časté výrazy a frázy
2001 Kluwer Academic accepted algebraic algorithm alphabet automata automaton axioms Berlin Biology Meet C₁ components Computer Science consider contains context context-free grammar context-free languages controlled defined Definition denote derivation deterministic Turing machines DNA computing edge elements exists family of languages finite set formal language theory function gerbier grammar G grammar systems graph H systems hyperedge infinite input integer interaction Lemma linear Linguistics and Biology M₁ Martin-Vide Mathematics MDS descriptor membrane methylation Mitrana eds molecular structure nondeterministic nonterminal obtained operations output P₁ pair parallel parallel communicating Păun permutation polypode power series probabilistic automaton problem Proof properties Proposition rational recombination recursively enumerable languages regular grammar regular languages result rewriting Rozenberg Salomaa semiring sentential form sequence simulate splicing languages splicing rules splicing systems Springer st(ag step stream X-machines strings subset symbols tape Theorem Tr(Xn transduction tube w-languages word X-machines