Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

RACE - Rapid Amplification of cDNA Ends

RACE - Rapid Amplification of cDNA Ends

Rapid Amplification of cDNA Ends, or RACE, is one of the most effective methods to obtain a full-length cDNA from an mRNA sequence between a known internal region to the unknown sequence at the 5’ or 3’ end. The unknown region is cloned in the cDNA by a gene-specific primer that binds the known end, and a hybrid primer that attaches a predefined anchor sequence to the unknown end of the cDNA. The sequence in between is amplified by PCR with an anchor primer and a gene-specific primer.
Since the...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Parallel algorithms and architectures based on pipelined optical buses.

Applied optics·2010

Same author

Interferometric atmospheric refractive-index environmental monitor.

Applied optics·2010

Same author

Regular geometries for folded optical modules.

Applied optics·2010

Same author

Dynamics of hologram recording in DuPont photopolymer.

Applied optics·2010

Same author

Concentrators for focal-plane arrays.

Applied optics·2010

Same author

Deconvolution of multiple images of the same object.

Applied optics·2010

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

Monitoring GPCR-β-arrestin1/2 Interactions in Real Time Living Systems to Accelerate Drug Discovery

Monitoring GPCR-β-arrestin1/2 Interactions in Real Time Living Systems to Accelerate Drug Discovery

Published on: June 28, 2019

Finding the shortest path in the shortest time using PCNN's.

H J Caulfield¹, J M Kinser

¹Fisk University, Nashville, TN 37208-3051, USA.

IEEE Transactions on Neural Networks

|February 7, 2008

Summary

Pulse coupled neural networks (PCNNs) explore all maze paths simultaneously. This allows them to efficiently find the shortest route in the minimum possible time.

Area of Science:

Computational neuroscience
Artificial intelligence
Network dynamics

Background:

Pulse coupled neural networks (PCNNs) are biologically inspired computational models.
Traditional algorithms for maze solving can be time-consuming and computationally intensive.

Purpose of the Study:

To investigate the capability of PCNNs for solving mazes.
To demonstrate the efficiency of PCNNs in finding the shortest path.

Main Methods:

Implementing a PCNN model capable of exploring multiple paths concurrently.
Simulating the network's response to maze traversal tasks.

Main Results:

PCNNs exhibit non-deterministic maze running, exploring all possible paths.

More Related Videos

Adapting 3' Rapid Amplification of CDNA Ends to Map Transcripts in Cancer

Adapting 3' Rapid Amplification of CDNA Ends to Map Transcripts in Cancer

Published on: March 28, 2018

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Published on: June 28, 2018

Related Experiment Videos

Last Updated: Jul 7, 2026

Monitoring GPCR-β-arrestin1/2 Interactions in Real Time Living Systems to Accelerate Drug Discovery

Monitoring GPCR-β-arrestin1/2 Interactions in Real Time Living Systems to Accelerate Drug Discovery

Published on: June 28, 2019

Adapting 3' Rapid Amplification of CDNA Ends to Map Transcripts in Cancer

Adapting 3' Rapid Amplification of CDNA Ends to Map Transcripts in Cancer

Published on: March 28, 2018

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Published on: June 28, 2018

The network identifies the shortest path in the shortest time due to its parallel processing nature.

Conclusions:

PCNNs offer a novel and efficient approach to maze-solving problems.
The parallel processing inherent in PCNNs is advantageous for optimization tasks.