Formulating DNA Chains Using Effective Calculability
Nearly all computational algorithms are modeled as ‘Effective Calculability’ i.e Finite State Model and Lambda Calculus. Effectively calculable function Comprise of three parts: the info, the yield, and the finite state function or transition function. It takes stream of data as input and translates to specific output, as defined by transition function . The aftereffect of this conversion is another flood of information or the yield. Both i.e info and yield information streams comprise of arrangements of characters and are known as strings. DNA exhibits a property of being a pattern of strings. Automatic machines like automata and Lambda Calculus or simply the Effective Calculability  can be an efficient approach to study these patterns. By the introduction of Effective Calculability we can express the pattern of DNA in much better way. The transition function runs stepwise each character of the information string to produce the output string. The transformations achieved by the transition function are relatively simple in nature. Complex computations and operations can be affected by linking together several Effective Calculability switches so that the output string of one switch becomes the input string of another switch.
. J.H. Holland, in: Automata, Languages, Development, A. Lindenmayer and G. Rozenberg, eds. (North-Holland, Amsterdam, 1976), pp. 385-404.
. R. Ransom, Computers and Embryos: Models in Developmental Biology (Wiley, New York, 1981), pp. 106-156, 184-189.
. B. Lewin, Gene Expression, vol. III, Plasmids and Phages (Wiley-Interscience, New York, 1977).
. L. Nover, M. Luckner and B. Parthier, ed., Cell Differentiation: Molecular Basis and Problems (Springer, New York, 1982).
. Razin and A.D. Riggs, Science 210 (1980) 604.
. S,B, Zimmerman, Ann. Rev. Biochem. 51 (1982) 395.
. L. Nover and H. Reinbothe, in: Cell Differentiation: Molecular Basis and Problems, L. Nover, M. Luckner and B. Parthier, eds. (Springer, New York, 1982), pp. 23-74.
. Effective Calculability and Unsolvability. http://www.compsci.hunter.cuny.edu /~sweiss/course_materials/csci265/Unsolvability.pdf
. R. Breathnach and P. Chambon, Ann. Rev. Biochem. (1981) 349.
. L. Gold, D. Pribnow, T. Schneider, S. Shmedling, B.S. Singer and G. Stormo, Ann. Rev. Microbiol. 35 (1981) 365.
. J. Fickett, Nucl. Acids Res. 10 (1982) 5303.
. W.B. Goad and M.I. Kanehisa, Nucl. Acids Res. 10 (1982) 247.
. L. Nover, in: Cell Differentiation: Molecular Basis and Problems, L. Nover, M. Luckner and B. Parthier, eds. (Springer, New York, 1982), pp. 99-256.
. T.F. Smith, M.S. Waterman and C. Burks, LANL Preprint LA-UR-83-1661 (1983) Los Alamos National Laboratory.
. Reengineering the Industrial Capability and Maturity Model Integration, Journal of Advances in Computer Engineering and Technology (JACET). Volume 4, Issue 3
. R.E. Dickerson and H.R. Drew, J. Mol. Biol. 149 (1981) 761.
. R.E. Dickerson, H.R. Drew, B.N. Conner, R.M. Wing, A.V. Fratini and M.L. Kopka, Science 216 (1982) 475.
. R.E. Dickerson and H.R. Drew, Proc. Natl. Acad. Sci. USA 78 (1981) 7318.
. W. Kabsch, C. Sander and E.N. Trifinov, Nucl. Acids Res. 10 (1982) 1097.
. R.E. Dickerson, J. Mol. Biol. 166 (1983) 419.
Authors who submit papers with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
- By submitting the processing fee, it is understood that the author has agreed to our terms and conditions which may change from time to time without any notice.
- It should be clear for authors that the Editor In Chief is responsible for the final decision about the submitted papers; have the right to accept\reject any paper. The Editor In Chief will choose any option from the following to review the submitted papers:A. send the paper to two reviewers, if the results were negative by one reviewer and positive by the other one; then the editor may send the paper for third reviewer or he take immediately the final decision by accepting\rejecting the paper. The Editor In Chief will ask the selected reviewers to present the results within 7 working days, if they were unable to complete the review within the agreed period then the editor have the right to resend the papers for new reviewers using the same procedure. If the Editor In Chief was not able to find suitable reviewers for certain papers then he have the right to reject the paper.
- Author will take the responsibility what so ever if any copyright infringement or any other violation of any law is done by publishing the research work by the author
- Before publishing, author must check whether this journal is accepted by his employer, or any authority he intends to submit his research work. we will not be responsible in this matter.
- If at any time, due to any legal reason, if the journal stops accepting manuscripts or could not publish already accepted manuscripts, we will have the right to cancel all or any one of the manuscripts without any compensation or returning back any kind of processing cost.
- The cost covered in the publication fees is only for online publication of a single manuscript.