83
Views
1
CrossRef citations to date
0
Altmetric
Section A

Mutation systems

, &
Pages 1132-1149 | Received 26 Aug 2011, Accepted 20 Jul 2012, Published online: 29 Aug 2012

References

  • Alberts , B. , Johnson , A. , Lewis , J. , Raff , M. , Roberts , K. and Walter , P. 2002 . Molecular Biology of the Cell , New York : Garland Science .
  • Angluin , D. , Aspnes , J. and Barbosa Vargas , R. Mutation systems . Language and Automata Theory and Applications: 5th International Conference, LATA 2011 . May 26–31 2011 , Tarragona , Spain. Edited by: Dediu , A.-H. , Inenaga , S. and Martin-Vide , C. pp. 92 – 104 . Berlin : Springer-Verlag . Proceedings, Vol. 6638 of Lecture Notes in Computer Science
  • Bennett , C. H. 1973 . Logical reversibility of computation . IBM J. Res. Dev. , 17 : 525 – 532 . (doi:10.1147/rd.176.0525)
  • Bennett , C. H. 1982 . The thermodynamics of computation – A review . Int. J. Theor. Phys. , 21 : 905 – 940 . (doi:10.1007/BF02084158)
  • Brzozowski , J. A. and Simon , I. 1973 . Characterizations of locally testable events . Discrete Math. , 4 : 243 – 271 . (doi:10.1016/S0012-365X(73)80005-6)
  • Cavaliere , M. and Leupold , P. 2004 . Evolution and observation – A non-standard way to generate formal languages . Theoret. Comput. Sci. , 321 : 233 – 248 . (doi:10.1016/j.tcs.2004.03.036)
  • Cavaliere , M. and Leupold , P. 2010 . Computing by observing: Simple systems and simple observers . Theoret. Comput. Sci. , 412 : 113 – 123 . (doi:10.1016/j.tcs.2010.05.040)
  • De Jong , K. A. 2006 . Evolutionary Computation: A Unified Approach , Cambridge , MA : MIT Press .
  • García , P. and Vidal , E. 1990 . Inference of k-testable languages in the strict sense and application to syntactic pattern recognition . IEEE Trans. Pattern Anal. Mach. Intell. , 12 : 920 – 925 . (doi:10.1109/34.57687)
  • Head , T. 1998 . Splicing representations of strictly locally testable languages . Discrete Appl. Math. , 87 : 139 – 147 . (doi:10.1016/S0166-218X(98)00053-5)
  • Kari , J. 2005 . Theory of cellular automata: A survey . Theoret. Comput. Sci. , 334 ( 1–3 ) : 3 – 33 . (doi:10.1016/j.tcs.2004.11.021)
  • Kim , S. M. , McNaughton , R. and McCloskey , R. 1989 . A polynomial time algorithm for the local testability problem of deterministic finite automata . Algorithms Data Struct. , 382 : 420 – 436 . (doi:10.1007/3-540-51542-9_35)
  • Kobayashi , S. and Yokomori , T. 1994 . “ Learning concatenations of locally testable languages from positive data ” . In Algorithmic Learning Theory , Edited by: Arikawa , S. and Jantke , K. 407 – 422 . Berlin : Springer . Vol. 872 of Lecture Notes in Computer Science
  • Lindgren , K. and Nordahl , M. G. 1990 . Universal computation in simple one-dimensional cellular automata . Complex Systems , 4 : 299 – 318 .
  • McNaughton , R. 1974 . Algebraic decision procedures for local testability . Theory of Computing Systems , 8 ( 1 ) : 60 – 76 .
  • Quackenbush , J. 2001 . Computational analysis of microarray data . Genetics , 2 : 418 – 427 .
  • Tompa , M. and Prakash , A. 2005 . Discovery of regulatory elements in vertebrates through comparative genomics . Nat. Biotechnol. , 23 ( 10 ) : 1249 – 1256 . (doi:10.1038/nbt1140)
  • Tompa , M. , Li , N. and Bailey , T. 2005 . Assessing computational tools for the discovery of transcriptional factor binding sites . Nat. Biotechnol. , 23 ( 1 ) : 137 – 144 . (doi:10.1038/nbt1053)
  • Valiant , L. G. 2009 . Evolvability . J. ACM , 56 : 3:1 – 3:21 . (doi:10.1145/1462153.1462156)
  • Von Neumann , J. 1966 . Theory of Self-Reproducing Automata , Edited by: Burks , A. W. Urbana , IL : University of Illinois Press .
  • Wasserman , W. W. and Sandelin , A. 2004 . Applied bioinformatics for the identification of regulatory elements . Genetics , 5 : 276 – 287 .
  • Yokomori , T. and Kobayashi , S. 1998 . Learning local languages and their application to DNA sequence analysis . IEEE Trans. Pattern Anal. Mach. Intell. , 20 : 1067 – 1079 . (doi:10.1109/34.722617)

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.