COMMA-FREE AND SYNCHRONIZABLE CODES

被引:2
|
作者
NEVELN, B
机构
[1] Science Division, Widener University, Chester
关键词
D O I
10.1016/S0022-5193(05)80320-0
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Shepherd (1981. Proc. natn. Acad. Sci. U.S.A. 78, 1596-1600), Clarke (1982. J. theor. Biol. 99, 397-403), Crick et al. (1976. Origins of Life 7, 389) have put forward the possibility that there was a code, ancestral to the existing genetic code, which was non-degenerate and comma-free. The point of a comma-free code, as first proposed in Crick et al. (1957), is that it provides immunity from frameshift reading errors. In this paper it is argued that if frameshift error immunity is to be used as a selection factor in guiding the search for a hypothetical ancestral code, then the appropriate mathematical formulation of this characteristic is not comma-freeness but synchronizability. The calling card of the comma-free notion is that it results in a limit of 20 on the number of sense codons when applied to the genetic coding system. But so does synchronizability, which includes comma-freeness as a special case. Further, using synchronizability as a constraint instead of comma-freeness yields roughly 3000 times as many potential models for an ancestral code. In particular, the RNY model becomes more compatible with immunity from frameshift error as an evolutionary constraint. © 1990 Academic Press Limited.
引用
收藏
页码:209 / 212
页数:4
相关论文
共 50 条
  • [21] Finite completion of comma-free codes part 1
    Lam, NH
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2004, 38 (02): : 91 - 115
  • [22] A relation between trinucleotide comma-free codes and trinucleotide circular codes
    Michel, Christian J.
    Pirillo, Giuseppe
    Pirillo, Mario A.
    THEORETICAL COMPUTER SCIENCE, 2008, 401 (1-3) : 17 - 26
  • [23] Hall sets, Lazard sets and comma-free codes
    Perrin, Dominique
    Reutenauer, Christophe
    DISCRETE MATHEMATICS, 2018, 341 (01) : 232 - 243
  • [24] FINITE STATE MODELS IN THE STUDY OF COMMA-FREE CODES
    LLEWELLYN, JA
    COMPUTER JOURNAL, 1983, 26 (04): : 303 - 311
  • [25] CONSTRUCTION OF VARIABLE-LENGTH COMMA-FREE CODES.
    Llewellyn, John A.
    1600, (28):
  • [26] Diletter and triletter comma-free codes over finite alphabets
    Fimmel, Elena
    Michel, Christian J.
    Pirot, Francois
    Sereni, Jean-sebastien
    Struengmann, Lutz
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 86 : 233 - 270
  • [27] CONSTRUCTION METHOD FOR PATH-INVARIANT COMMA-FREE CODES
    IMAI, H
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (04) : 555 - 559
  • [28] MAXIMAL AND VARIABLE WORD-LENGTH COMMA-FREE CODES
    SCHOLTZ, RA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (02) : 300 - +
  • [29] Finite completion of comma-free codes. Part I
    Nguyen, HL
    DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 357 - 368
  • [30] CONSTRUCTION METHOD OF MULTILEVEL COMMA-FREE CODE BASED ON BINARY COMMA-FREE CODE
    KATO, M
    INOSE, H
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1972, 55 (05): : 9 - 16