Relevant bibliographies by topics / Watson-Crick

Academic literature on the topic 'Watson-Crick'

Author: Grafiati
Published: 4 June 2021
Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Watson-Crick.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Watson-Crick"

1

Fong, Wan Heng, Aqilahfarhana Abdul Rahman, Nor Haniza Sarmin, and Sherzod Turaev. "Static Watson-Crick Context-Free Grammars." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 10 (June 27, 2019): 65. http://dx.doi.org/10.3991/ijoe.v15i10.10878.

Full text
Abstract:
Sticker systems and Watson-Crick automata are two modellings of DNA molecules in DNA computing. A sticker system is a computational model which is coded with single and double-stranded DNA molecules; while Watson-Crick automata is the automata counterpart of sticker system which represents the biological properties of DNA. Both of these models use the feature of Watson-Crick complementarity in DNA computing. Previously, the grammar counterpart of the Watson-Crick automata have been introduced, known as Watson-Crick grammars which are classified into three classes: Watson-Crick regular grammars, Watson-Crick linear grammars and Watson-Crick context-free grammars. In this research, a new variant of Watson-Crick grammar called a static Watson-Crick context-free grammar, which is a grammar counterpart of sticker systems that generates the double-stranded strings and uses rule as in context-free grammar, is introduced. The static Watson-Crick context-free grammar differs from a dynamic Watson-Crick context-free grammar in generating double-stranded strings, as well as for regular and linear grammars. The main result of the paper is to determine the generative powers of static Watson-Crick context-free grammars. Besides, the relationship of the families of languages generated by Chomsky grammars, sticker systems and Watson-Crick grammars are presented in terms of their hierarchy.
APA, Harvard, Vancouver, ISO, and other styles
2

Abdul Rahman, Aqilahfarhana, Wan Heng Fong, Nor Haniza Sarmin, Sherzod Turaev, and Nurul Liyana Mohamad Zulkufli. "Static Watson-Crick regular grammar." Malaysian Journal of Fundamental and Applied Sciences 14 (October 25, 2018): 457–62. http://dx.doi.org/10.11113/mjfas.v14n0.1282.

Full text
Abstract:
DNA computing, or more generally, molecular computing, is a recent development at the interface of computer science and molecular biology. In DNA computing, many computational models have been proposed in the framework of formal language theory and automata such as Watson-Crick grammars and sticker systems. A Watson-Crick grammar is a grammar model that generates double stranded strings, whereas a sticker system is a DNA computing model of the ligation and annealing operations over DNA strands using the Watson-Crick complementarity to form a complete double stranded DNA sequence. Most of the proposed DNA computing models make use of this concept, including the Watson-Crick grammars and sticker systems. Watson-Crick grammars and their variants can be explored using formal language theory which allows the development of new concepts of Watson-Crick grammars. In this research, a new variant of Watson-Crick grammar called a static Watson-Crick regular grammar is introduced as an analytical counterpart of sticker systems. The computation of a sticker system starts from a given set of incomplete double stranded sequence to form a complete double stranded sequence. Here, a static Watson-Crick regular grammar differs from a dynamic Watson-Crick regular grammar in generating double stranded strings: the latter grammar produces each strand string “independently” and only check for the Watson-Crick complementarity of a generated complete double stranded string at the end, while the former grammar generates both strand strings “dependently”, i.e., checking for the Watson-Crick complementarity for each complete substring. In this paper, computational properties of static Watson-Crick regular grammars are investigated to correlate with the Chomsky hierarchy and hierarchy of the families of dynamic Watson-Crick regular languages. The relationship between families of languages generated by static Watson-Crick regular grammars with several variants of sticker systems, Watson-Crick regular grammars and Chomsky grammars are presented by showing the hierarchy.
APA, Harvard, Vancouver, ISO, and other styles
3

Fong, Wan Heng, Aqilahfarhana Abdul Rahman, Nor Haniza Sarmin, and Sherzod Turaev. "Computational Power of Static Watson-Crick Context-free Grammars." Science Proceedings Series 1, no. 2 (April 24, 2019): 82–85. http://dx.doi.org/10.31580/sps.v1i2.679.

Full text
Abstract:
Sticker system is a computer model which is coded with single and double-stranded molecules of DNA; meanwhile, Watson-Crick automata is the automata counterpart of the sticker system representing the biological properties of DNA. Both are the modelings of DNA molecules in DNA computing which use the feature of Watson-Crick complementarity. Formerly, Watson-Crick grammars which are classified into three classes have been introduced [1]. In this research, a grammar counterpart of sticker systems that uses the rule as in context-free grammar is introduced, known as a static Watson-Crick context-free grammar. The research finding on the computational power of these grammar shows that the family of context-free languages is strictly included in the family of static Watson-Crick context-free languages; the static Watson-Crick context-free grammars can generate non context-free languages; the family of Watson-Crick context-free languages is included in the family of static Watson-Crick context-free languages which are presented in terms of their hierarchy.
APA, Harvard, Vancouver, ISO, and other styles
4

Rangadurai, Atul, Eric S. Szymanski, Isaac Kimsey, Honglue Shi, and Hashim M. Al-Hashimi. "Probing conformational transitions towards mutagenic Watson–Crick-like G·T mismatches using off-resonance sugar carbon R1ρ relaxation dispersion." Journal of Biomolecular NMR 74, no. 8-9 (August 12, 2020): 457–71. http://dx.doi.org/10.1007/s10858-020-00337-7.

Full text
Abstract:
Abstract NMR off-resonance R1ρ relaxation dispersion measurements on base carbon and nitrogen nuclei have revealed that wobble G·T/U mismatches in DNA and RNA duplexes exist in dynamic equilibrium with short-lived, low-abundance, and mutagenic Watson–Crick-like conformations. As Watson–Crick-like G·T mismatches have base pairing geometries similar to Watson–Crick base pairs, we hypothesized that they would mimic Watson–Crick base pairs with respect to the sugar-backbone conformation as well. Using off-resonance R1ρ measurements targeting the sugar C3′ and C4′ nuclei, a structure survey, and molecular dynamics simulations, we show that wobble G·T mismatches adopt sugar-backbone conformations that deviate from the canonical Watson–Crick conformation and that transitions toward tautomeric and anionic Watson–Crick-like G·T mismatches restore the canonical Watson–Crick sugar-backbone. These measurements also reveal kinetic isotope effects for tautomerization in D2O versus H2O, which provide experimental evidence in support of a transition state involving proton transfer. The results provide additional evidence in support of mutagenic Watson–Crick-like G·T mismatches, help rule out alternative inverted wobble conformations in the case of anionic G·T−, and also establish sugar carbons as new non-exchangeable probes of this exchange process.
APA, Harvard, Vancouver, ISO, and other styles
5

KARI, LILA, and KALPANA MAHALINGAM. "WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID." International Journal of Foundations of Computer Science 19, no. 05 (October 2008): 1163–79. http://dx.doi.org/10.1142/s0129054108006200.

Full text
Abstract:
DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways. One of the structures that is usually undesirable for biocomputation, since it makes the affected DNA string unavailable for future interactions, is the hairpin: If some subsequences of a DNA single string are complementary to each other, the string will bind to itself forming a hairpin-like structure. This paper studies a mathematical formalization of a particular case of hairpins, the Watson-Crick bordered words. A Watson-Crick bordered word is a word with the property that it has a prefix that is Watson-Crick complementary to its suffix. We namely study algebraic properties of Watson-Crick bordered and unbordered words. We also give a complete characterization of the syntactic monoid of the language consisting of all Watson-Crick bordered words over a given alphabet. Our results hold for the more general case where the Watson-Crick complement function is replaced by an arbitrary antimorphic involution.
APA, Harvard, Vancouver, ISO, and other styles
6

Jemima, Samuel Mary, and Rajkumar Dare. "Watson-Crick Local Languages and Watson-Crick Two Dimensional Local Languages." International Journal of Mathematics and Soft Computing 5, no. 2 (July 10, 2015): 165. http://dx.doi.org/10.26708/ijmsc.2015.2.5.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mahalingam, Kalpana, Ujjwal Kumar Mishra, and Rama Raghavan. "Watson–Crick Jumping Finite Automata." International Journal of Foundations of Computer Science 31, no. 07 (November 2020): 891–913. http://dx.doi.org/10.1142/s0129054120500331.

Full text
Abstract:
Watson–Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson–Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double stranded string, the automata can jump over some subsequence and continue scanning depending on the rule. Some variants of such automata are 1-limited, No state, All final and Simple Watson–Crick jumping finite automata. The comparison of the languages accepted by these variants with the language classes in Chomsky hierarchy has been carried out. We investigate some closure properties. We also try to place the duplication closure of a word in Watson–Crick jumping finite automata family. We have discussed the closure property of Watson–Crick jumping finite automata family under duplication operations.
APA, Harvard, Vancouver, ISO, and other styles
8

Xu, Yu, Akanksha Manghrani, Bei Liu, Honglue Shi, Uyen Pham, Amy Liu, and Hashim M. Al-Hashimi. "Hoogsteen base pairs increase the susceptibility of double-stranded DNA to cytotoxic damage." Journal of Biological Chemistry 295, no. 47 (September 10, 2020): 15933–47. http://dx.doi.org/10.1074/jbc.ra120.014530.

Full text
Abstract:
As the Watson–Crick faces of nucleobases are protected in dsDNA, it is commonly assumed that deleterious alkylation damage to the Watson–Crick faces of nucleobases predominantly occurs when DNA becomes single-stranded during replication and transcription. However, damage to the Watson–Crick faces of nucleobases has been reported in dsDNA in vitro through mechanisms that are not understood. In addition, the extent of protection from methylation damage conferred by dsDNA relative to ssDNA has not been quantified. Watson–Crick base pairs in dsDNA exist in dynamic equilibrium with Hoogsteen base pairs that expose the Watson–Crick faces of purine nucleobases to solvent. Whether this can influence the damage susceptibility of dsDNA remains unknown. Using dot-blot and primer extension assays, we measured the susceptibility of adenine-N1 to methylation by dimethyl sulfate (DMS) when in an A-T Watson–Crick versus Hoogsteen conformation. Relative to unpaired adenines in a bulge, Watson–Crick A-T base pairs in dsDNA only conferred ∼130-fold protection against adenine-N1 methylation, and this protection was reduced to ∼40-fold for A(syn)-T Hoogsteen base pairs embedded in a DNA-drug complex. Our results indicate that Watson–Crick faces of nucleobases are accessible to alkylating agents in canonical dsDNA and that Hoogsteen base pairs increase this accessibility. Given the higher abundance of dsDNA relative to ssDNA, these results suggest that dsDNA could be a substantial source of cytotoxic damage. The work establishes DMS probing as a method for characterizing A(syn)-T Hoogsteen base pairs in vitro and also lays the foundation for a sequencing approach to map A(syn)-T Hoogsteen and unpaired adenines genome-wide in vivo.
APA, Harvard, Vancouver, ISO, and other styles
9

Chatterjee, Kingshuk, and Kumar Sankar Ray. "Reversible Watson–Crick automata." Acta Informatica 54, no. 5 (April 19, 2016): 487–99. http://dx.doi.org/10.1007/s00236-016-0267-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chatterjee, Kingshuk, and Kumar Sankar Ray. "Unary Watson-Crick automata." Theoretical Computer Science 782 (August 2019): 107–12. http://dx.doi.org/10.1016/j.tcs.2019.03.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Watson-Crick"

1

Pan, Baocheng. "X-ray crystallographic studies on oligonucleotide structures containing non-watson-crick base pairs /." The Ohio State University, 1998. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487951907958194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Silvester, Nicole Cherie. "Terminal Modifications of PNA and Their Use in Diagnostic and Antisense Technologies." Thesis, Griffith University, 2008. http://hdl.handle.net/10072/366991.

Full text
Abstract:
Peptide nucleic acids (PNA) are analogues of DNA that bind to DNA and RNA via Watson-Crick base-pairing rules. Due to the lack of a negatively-charged backbone, hybridisation of PNA to DNA or RNA occurs without electrostatic repulsion thus binding is typically stronger and more rapid than when traditional DNA probes are used. This is reflected in the increased melting temperature (Tm) of the conjugates. These properties, as well as the chemical and biological stability of PNA, make these molecules attractive for use in diagnostic and therapeutic applications. Amino acids are routinely conjugated to PNA probes to enhance the synthesis and solubility of the probes or assist with their cellular delivery, however little thought is given to the impact these modifications have on their hybridisation properties. In this work, a series of PNA-peptide chimeric assemblies based around a single PNA sequence were used to investigate the effect different amino acids have on the stability and specificity of PNA/DNA hybridisation. These experiments demonstrated that the positively charged amino acid lysine, which is routinely conjugated to PNA probes, increases the stability of the resultant PNA/DNA duplexes such that at many experimental temperatures, single base mismatched target DNA will also stably hybridise with PNA. In contrast, the negatively charged amino acid glutamic acid decreases the thermal stability of the mismatch duplexes sufficiently so that they are not stable at most experimental temperatures, whilst the fully complementary duplex is. This indicates that glutamic acid should replace lysine as the routine solubility enhancing group used for PNA probes.
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Biomolecular and Physical Sciences
Science, Environment, Engineering and Technology
Full Text
APA, Harvard, Vancouver, ISO, and other styles
3

Ke, Song-Hua. "Determination of non-watson-crick base pair stability and development of a new method for mutation detection." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/25198.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mahalingam, Kalpana. "Involution codes with application to DNA strand design." [Tampa, Fla.] : University of South Florida, 2004. http://purl.fcla.edu/fcla/etd/SFE0000409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Khisamutdinov, Emil. "Part I Nucleic Acid Site-Selective Binding Studies of Isomers of Dihydrodioxin-Masked Ortho-Quinones as Potential Antitumor Drugs Part II The Role of Non-Watson-Crick Base Pairs in Stabilizing Recurrent RNA Motif." Bowling Green State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1339432575.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abu, Almakarem Amal S. "Base Triples in RNA 3D Structures: Identifying, Clustering and Classifying." Bowling Green State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1308783522.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chin, Ko-Hsin, and 秦可欣. "Deformed Watson-Crick Base Pair." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/29108891764741487083.

Full text
Abstract:
博士
國立中興大學
生物化學研究所
90
In 1953, James Watson and Francis Crick deduced the double helical structure of DNA and immediately inferred its mechanism of replication. This brilliant accomplishment is ranked as one of the most significant stepping stone in the history of biology because it leads to the understanding of gene function at molecular level. Thus, it has been well known that Watson-Crick base pairing is very stable. However, we have found that it is not always the case; Watson-Crick pairing can sometimes form alternate conformations, i.e. the canonical Watson-Crick G/C or A/T hydrogen-bonded base pairs can be either induced to become perpendicular with the base plane or be transformed into stacked pair. Such facile manipulation of Watson-Crick pair in either trans or cis way greatly increases the repertoire for unusual nucleic acid structural motifs and for sequence-specific DNA recognitions.
APA, Harvard, Vancouver, ISO, and other styles
8

Sears, David. "The Computational Power of Extended Watson-Crick L Systems." Thesis, 2010. http://hdl.handle.net/1974/6224.

Full text
Abstract:
Lindenmayer (L) systems form a class of interesting computational formalisms due to their parallel nature, the various circumstances under which they operate, the restrictions imposed on language acceptance, and other attributes. These systems have been extensively studied in the Formal Languages literature. In the past decade a new type of Lindenmayer system had been proposed: Watson-Crick Lindenmayer Systems. These systems are essentially a marriage between Developmental systems and DNA Computing. At their heart they are Lindenmayer systems augmented with a complementary relation amongst elements in the system just as the base pairs of DNA strands can be complementary with respect to one another. When conditions and a mechanism for 'switching' the state of a computation to it's complementary version are provided then these systems can become surprisingly more powerful than the L systems which form their backbone. This dissertation explores the computational power of new variants of Watson-Crick L systems. It is found that many of these systems are Computationally-Complete. These investigations differ from prior ones in that the systems under consideration have extended alphabets and usually Regular Triggers for complementation are considered as opposed to Context-Free Triggers investigated in previous works.
Thesis (Master, Computing) -- Queen's University, 2010-12-06 18:29:23.584
APA, Harvard, Vancouver, ISO, and other styles
9

Kimsey, Isaac Joseph. "Visualizing Rare Watson-Crick-Like Tautomeric and Anionic Mismatches in DNA and RNA." Diss., 2016. http://hdl.handle.net/10161/12885.

Full text
Abstract:

The central dogma of molecular biology relies on the correct Watson-Crick (WC) geometry of canonical deoxyribonucleic acid (DNA) dG•dC and dA•dT base pairs to replicate and transcribe genetic information with speed and an astonishing level of fidelity. In addition, the Watson-Crick geometry of canonical ribonucleic acid (RNA) rG•rC and rA•rU base pairs is highly conserved to ensure that proteins are translated with high fidelity. However, numerous other potential nucleobase tautomeric and ionic configurations are possible that can give rise to entirely new pairing modes between the nucleotide bases. Very early on, James Watson and Francis Crick recognized their importance and in 1953 postulated that if bases adopted one of their less energetically disfavored tautomeric forms (and later ionic forms) during replication it could lead to the formation of a mismatch with a Watson-Crick-like geometry and could give rise to “natural mutations.”

Since this time numerous studies have provided evidence in support of this hypothesis and have expanded upon it; computational studies have addressed the energetic feasibilities of different nucleobases’ tautomeric and ionic forms in siico; crystallographic studies have trapped different mismatches with WC-like geometries in polymerase or ribosome active sites. However, no direct evidence has been given for (i) the direct existence of these WC-like mismatches in canonical DNA duplex, RNA duplexes, or non-coding RNAs; (ii) which, if any, tautomeric or ionic form stabilizes the WC-like geometry. This thesis utilizes nuclear magnetic resonance (NMR) spectroscopy and rotating frame relaxation dispersion (R1ρ RD) in combination with density functional theory (DFT), biochemical assays, and targeted chemical perturbations to show that (i) dG•dT mismatches in DNA duplexes, as well as rG•rU mismatches RNA duplexes and non-coding RNAs, transiently adopt a WC-like geometry that is stabilized by (ii) an interconnected network of rapidly interconverting rare tautomers and anionic bases. These results support Watson and Crick’s tautomer hypothesis, but additionally support subsequent hypotheses invoking anionic mismatches and ultimately tie them together. This dissertation shows that a common mismatch can adopt a Watson-Crick-like geometry globally, in both DNA and RNA, and whose geometry is stabilized by a kinetically linked network of rare tautomeric and anionic bases. The studies herein also provide compelling evidence for their involvement in spontaneous replication and translation errors.


Dissertation
APA, Harvard, Vancouver, ISO, and other styles
10

Liou, Shih-Jhang, and 劉仕章. "Biosensor development based on non-Watson-Crick base pairings combing with signal amplification strategy." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/kdw7x3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Watson-Crick"

1

Crick, Watson & DNA. London: Arrow, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Crick, Watson, and DNA. New York: Anchor Books, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Anniss, Matt. James Watson and Francis Crick. New York, NY: Gareth Stevens Publishing, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sherrow, Victoria. James Watson & Francis Crick: Decoding the secrets of DNA. Woodbridge, Conn: Blackbirch Press Book, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sherrow, Victoria. James Watson & Francis Crick: Decoding the secrets of DNA. Woodbridge, Conn: Blackbirch Press Book, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gallardo-Cabello, Manuel. Atrapados en la doble hélice: James Watson y Francis Crick. México: Consejo Nacional para la Cultura y las Artes, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gallardo-Cabello, Manuel. Atrapados en la doble hélice: James Watson y Francis Crick. México: Consejo Nacional para la Cultura y las Artes, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gallardo-Cabello, Manuel. Atrapados en la doble he lice: James Watson, Francis Crick. Me xico, D.F: Editorial Pax Me xico, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Francis Crick and James Watson and the building blocks of life. New York: Oxford University Press, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Newton, David E. James Watson & Francis Crick: Discovery of the double Helix and behond. New York: Facts on File, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Watson-Crick"

1

Cleaves, Henderson James. "Watson–Crick Pairing." In Encyclopedia of Astrobiology, 1775–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-11274-4_1683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cleaves, Henderson James. "Watson-Crick Pairing." In Encyclopedia of Astrobiology, 2650. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-44185-5_1683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Păun, Gheorghe, Grzegorz Rozenberg, and Arto Salomaa. "Watson—Crick Automata." In DNA Computing, 151–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-662-03563-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cleaves, Henderson James. "Watson-Crick Pairing." In Encyclopedia of Astrobiology, 1. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-27833-4_1683-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cleaves, Henderson James. "Watson-Crick Pairing." In Encyclopedia of Astrobiology, 1. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-642-27833-4_1683-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kulkarni, Manasi S., Kalpana Mahalingam, and Ananda Chandra Nayak. "Watson-Crick Partial Words." In Theory and Practice of Natural Computing, 190–202. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71069-3_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Freund, R., Gh Păun, G. Rozenberg, and A. Salomaa. "Watson-Crick finite automata." In DNA Based Computers III, 297–327. Providence, Rhode Island: American Mathematical Society, 1999. http://dx.doi.org/10.1090/dimacs/048/22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mohamad Zulkufli, N. L., S. Turaev, M. I. Mohd Tamrin, and A. Messikh. "Watson-Crick Linear Grammars." In Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015), 403–12. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-1799-6_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kutrib, Martin, and Andreas Malcher. "Two-Party Watson-Crick Computations." In Implementation and Application of Automata, 191–200. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18098-9_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mahalingam, Kalpana, Rama Raghavan, and Ujjwal Kumar Mishra. "Watson-Crick Jumping Finite Automata." In Lecture Notes in Computer Science, 467–80. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14812-6_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Watson-Crick"

1

Samuel, Mary Jemima, and V. R. Daret. "Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton." In 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2010. http://dx.doi.org/10.1109/bicta.2010.5645070.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tamrin, Mohd Izzuddin Mohd, Sherzod Turaev, and Tengku Mohd Tengku Sembok. "Weighted Watson-Crick automata." In PROCEEDINGS OF THE 21ST NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM21): Germination of Mathematical Sciences Education and Research towards Global Sustainability. AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4887606.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Subramanian, K. G., S. Hemalatha, and Ibrahim Venkat. "On Watson-Crick automata." In the Second International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2393216.2393242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Carell, T. "DNA bases beyond Watson and Crick." In XVIth Symposium on Chemistry of Nucleic Acid Components. Prague: Institute of Organic Chemistry and Biochemistry, Academy of Sciences of the Czech Republic, 2014. http://dx.doi.org/10.1135/css201414175.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Csuhaj-Varjú, Erzsébet, and Arto Salomaa. "Networks of Watson-Crick D0L systems." In Proceedings of the International Colloquium. WORLD SCIENTIFIC, 2003. http://dx.doi.org/10.1142/9789812704979_0009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zulkufli, Nurul Liyana binti Mohamad, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin, and Messikh Azeddine. "Closure properties of Watson-Crick grammars." In INNOVATION AND ANALYTICS CONFERENCE AND EXHIBITION (IACE 2015): Proceedings of the 2nd Innovation and Analytics Conference & Exhibition. AIP Publishing LLC, 2015. http://dx.doi.org/10.1063/1.4937082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jan, Nurhidaya Mohamad, Fong Wan Heng, Nor Haniza Sarmin, and Sherzod Turaev. "Closure properties of Watson-Crick Petri net." In PROCEEDING OF THE 25TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM25): Mathematical Sciences as the Core of Intellectual Excellence. Author(s), 2018. http://dx.doi.org/10.1063/1.5041659.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Binti Mohamad Zulkufli, Nurul Liyana, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin, Azeddine Messikh, and Imad Fakhri Taha Alshaikhli. "Computational Properties of Watson-Crick Context-Free Grammars." In 2015 4th International Conference on Advanced Computer Science Applications and Technologies (ACSAT). IEEE, 2015. http://dx.doi.org/10.1109/acsat.2015.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cojocaru, Liliana. "Watson-Crick automata and PCFAS with two components." In the first conference on computing frontiers. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/977091.977113.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rothemund, Paul W. K. "Beyond Watson and Crick: Programming DNA self-assembly for nanofabrication." In 2012 7th IEEE International Conference on Nano/Micro Engineered and Molecular Systems (NEMS). IEEE, 2012. http://dx.doi.org/10.1109/nems.2012.6196703.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Watson-Crick' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography