Related Experiment Video
Updated: Mar 19, 2026

Rare Event Detection Using Error-corrected DNA and RNA Sequencing
Published on: August 3, 2018
A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n2 Pairwise Distances in n2 Steps for
1Institute of Cytology and Genetics , SB RAS, Novosibirsk, Russia .
Abstract:
A new uniform algorithm based on sequential removal of redundancy from inputs is proposed to solve the turnpike and beltway problems. For error-free inputs that simulate experimental data with high accuracy, the size of inputs decreases from [Formula: see text] to [Formula: see text], which permits one to eliminate exhaustive search almost completely and reconstruct sequences in [Formula: see text] steps. Computational experiments show high efficiency of the algorithm for both the turnpike and beltway cases, with the reconstruction time for sequences of lengths up to several thousand elements being within 1 second on a modern PC.
Related Concept Videos
Distance Problem
RNA-seq
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while...
Evolutionary Relationships through Genome Comparisons
Distance Measurements by Taping
The Distance Formula
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....

