|
Molecular Computer
DNA computing is an emerging branch of unconventional computing which uses DNA, biochemistry, and molecular biology hardware, instead of the traditional electronic computing. Research and development in this area concerns theory, experiments, and applications of DNA computing. Although the field originally started with the demonstration of a computing application by Len Adleman in 1994, it has now been expanded to several other avenues such as the development of storage technologies, nanoscale imaging modalities, synthetic controllers and reaction networks, etc. A brief history of DNA computing and molecular programming Leonard Adleman of the University of Southern California initially developed this field in 1994. — The first DNA computing paper. Describes a solution for the directed Hamiltonian path problem. Also available here: Adleman demonstrated a proof-of-concept use of DNA as a form of computation which solved the seven-point Hamiltonian path problem. Since th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NP-complete
In computational complexity theory, a problem is NP-complete when: # it is a problem for which the correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions. # the problem can be used to simulate every other problem for which we can verify quickly that a solution is correct. In this sense, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. If we could find solutions of some NP-complete problem quickly, we could quickly find the solutions of every other problem to which a given solution can be easily verified. The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, "nondeterministic" refers to nondeterministic Turing machines, a way of mathematically formalizing the idea of a brute-force search algorithm. Polynomial time refers to an amount of time that is considered "quick" for a de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Deoxyribozyme
Deoxyribozymes, also called DNA enzymes, DNAzymes, or catalytic DNA, are DNA oligonucleotides that are capable of performing a specific chemical reaction, often but not always catalytic. This is similar to the action of other biological enzymes, such as proteins or ribozymes (enzymes composed of RNA). However, in contrast to the abundance of protein enzymes in biological systems and the discovery of biological ribozymes in the 1980s, there is only little evidence for naturally occurring deoxyribozymes. Deoxyribozymes should not be confused with DNA aptamers which are oligonucleotides that selectively bind a target ligand, but do not catalyze a subsequent chemical reaction. With the exception of ribozymes, nucleic acid molecules within cells primarily serve as storage of genetic information due to its ability to form complementary base pairs, which allows for high-fidelity copying and transfer of genetic information. In contrast, nucleic acid molecules are more limited in their ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chemical Reaction Networks
A chemical substance is a form of matter having constant chemical composition and characteristic properties. Some references add that chemical substance cannot be separated into its constituent elements by physical separation methods, i.e., without breaking chemical bonds. Chemical substances can be simple substances (substances consisting of a single chemical element), chemical compounds, or alloys. Chemical substances are often called 'pure' to set them apart from mixtures. A common example of a chemical substance is pure water; it has the same properties and the same ratio of hydrogen to oxygen whether it is isolated from a river or made in a laboratory. Other chemical substances commonly encountered in pure form are diamond (carbon), gold, table salt ( sodium chloride) and refined sugar ( sucrose). However, in practice, no substance is entirely pure, and chemical purity is specified according to the intended use of the chemical. Chemical substances exist as solids, liqu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sticky End
DNA ends refer to the properties of the ends of linear DNA molecules, which in molecular biology are described as "sticky" or "blunt" based on the shape of the complementary strands at the terminus. In sticky ends, one strand is longer than the other (typically by at least a few nucleotides), such that the longer strand has bases which are left unpaired. In blunt ends, both strands are of equal length – i.e. they end at the same base position, leaving no unpaired bases on either strand. The concept is used in molecular biology, in cloning, or when subcloning insert DNA into vector DNA. Such ends may be generated by restriction enzymes that break the molecule's phosphodiester backbone at specific locations, which themselves belong to a larger class of enzymes called exonucleases and endonucleases. A restriction enzyme that cuts the backbones of both strands at non-adjacent locations leaves a staggered cut, generating two overlapping sticky ends, while an enzyme that makes a str ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oligonucleotide
Oligonucleotides are short DNA or RNA molecules, oligomers, that have a wide range of applications in genetic testing, research, and forensics. Commonly made in the laboratory by solid-phase chemical synthesis, these small bits of nucleic acids can be manufactured as single-stranded molecules with any user-specified sequence, and so are vital for artificial gene synthesis, polymerase chain reaction (PCR), DNA sequencing, molecular cloning and as molecular probes. In nature, oligonucleotides are usually found as small RNA molecules that function in the regulation of gene expression (e.g. microRNA), or are degradation intermediates derived from the breakdown of larger nucleic acid molecules. Oligonucleotides are characterized by the sequence of nucleotide residues that make up the entire molecule. The length of the oligonucleotide is usually denoted by " -mer" (from Greek ''meros'', "part"). For example, an oligonucleotide of six nucleotides (nt) is a hexamer, while one of 25 nt wou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Digital Logic
A logic gate is an idealized or physical device implementing a Boolean function, a logical operation performed on one or more Binary number, binary inputs that produces a single binary output. Depending on the context, the term may refer to an ideal logic gate, one that has for instance zero rise time and unlimited fan-out, or it may refer to a non-ideal physical device (see Ideal and real op-amps for comparison). Logic gates are primarily implemented using diodes or transistors acting as switch#Electronic switches, electronic switches, but can also be constructed using vacuum tubes, electromagnetic relays (relay logic), fluidic logic, pneumatics#Pneumatic logic, pneumatic logic, optics, molecular logic gate, molecules, or even analytical engine, mechanical elements. Now, most logic gates are made from MOSFETs (metal–oxide–semiconductor field-effect transistors). With amplification, logic gates can be cascaded in the same way that Boolean functions can be composed, allowing t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical NOT
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P, \mathord P or \overline. It is interpreted intuitively as being true when P is false, and false when P is true. Negation is thus a unary logical connective. It may be applied as an operation on notions, propositions, truth values, or semantic values more generally. In classical logic, negation is normally identified with the truth function that takes ''truth'' to ''falsity'' (and vice versa). In intuitionistic logic, according to the Brouwer–Heyting–Kolmogorov interpretation, the negation of a proposition P is the proposition whose proofs are the refutations of P. Definition ''Classical negation'' is an operation on one logical value, typically the value of a proposition, that produces a value of ''true'' when its operand is false, and a value of ''false'' when its operand is true. Thus if statement is true, then \neg P (pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical OR
In logic, disjunction is a logical connective typically notated as \lor and read aloud as "or". For instance, the English language sentence "it is raining or it is snowing" can be represented in logic using the disjunctive formula R \lor S , assuming that R abbreviates "it is raining" and S abbreviates "it is snowing". In classical logic, disjunction is given a truth functional semantics according to which a formula \phi \lor \psi is true unless both \phi and \psi are false. Because this semantics allows a disjunctive formula to be true when both of its disjuncts are true, it is an ''inclusive'' interpretation of disjunction, in contrast with exclusive disjunction. Classical proof theoretical treatments are often given in terms of rules such as disjunction introduction and disjunction elimination. Disjunction has also been given numerous non-classical treatments, motivated by problems including Aristotle's sea battle argument, Heisenberg's uncertainty principle, as well t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical AND
In logic, mathematics and linguistics, And (\wedge) is the truth-functional operator of logical conjunction; the ''and'' of a set of operands is true if and only if ''all'' of its operands are true. The logical connective that represents this operator is typically written as \wedge or . A \land B is true if and only if A is true and B is true, otherwise it is false. An operand of a conjunction is a conjunct. Beyond logic, the term "conjunction" also refers to similar concepts in other fields: * In natural language, the denotation of expressions such as English "and". * In programming languages, the short-circuit and control structure. * In set theory, intersection. * In lattice theory, logical conjunction ( greatest lower bound). * In predicate logic, universal quantification. Notation And is usually denoted by an infix operator: in mathematics and logic, it is denoted by \wedge, or ; in electronics, ; and in programming languages, &, &&, or and. In Jan Ł ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Personal Computer
A personal computer (PC) is a multi-purpose microcomputer whose size, capabilities, and price make it feasible for individual use. Personal computers are intended to be operated directly by an end user, rather than by a computer expert or technician. Unlike large, costly minicomputers and mainframes, time-sharing by many people at the same time is not used with personal computers. Primarily in the late 1970s and 1980s, the term home computer was also used. Institutional or corporate computer owners in the 1960s had to write their own programs to do any useful work with the machines. While personal computer users may develop their own applications, usually these systems run commercial software, free-of-charge software ("freeware"), which is most often proprietary, or free and open-source software, which is provided in "ready-to-run", or binary, form. Software for personal computers is typically developed and distributed independently from the hardware or operating system ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic Function
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra uses logical operators such as conjunction (''and'') denoted as ∧, disjunction (''or'') denoted as ∨, and the negation (''not'') denoted as ¬. Elementary algebra, on the other hand, uses arithmetic operators such as addition, multiplication, subtraction and division. So Boolean algebra is a formal way of describing logical operations, in the same way that elementary algebra describes numerical operations. Boolean algebra was introduced by George Boole in his first book ''The Mathematical Analysis of Logic'' (1847), and set forth more fully in his '' An Investigation of the Laws of Thought'' (1854). According to Huntington, the term "Boolean algebra" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
_DNAzyme.png "Click for more on -> Deoxyribozyme")
