Related Experiment Video
Updated: Apr 17, 2026

Constructing Cyclic Peptides Using an On-Tether Sulfonium Center
Published on: September 28, 2022
Reconstruction of sequence from its circular partial sums for cyclopeptide sequencing problem
1Institute of Cytology and Genetics, Siberian Branch of the Russian Academy of Sciences, 10 Prospekt Lavrentyeva, Novosibirsk 630090, Russian Federation.
Abstract:
In this paper, we consider the cyclopeptide sequencing problem that arose in computational biology with regard to de novo peptide sequencing in the 2000s. The sequencing problem for cyclic peptides is reduced in mathematics to the one-dimensional beltway problem: given a set of all circular pairwise distances between points, find the coordinates of these points. The beltway problem is one of the few fundamental problems that are neither known to be NP-complete nor solvable by polynomial-time algorithms. We develop an efficient algorithm for the cyclopeptide sequencing problem. The algorithm exploits information on possible elements of sequence and, thus, it makes it possible to restore sequences of lengths up to 160 elements. Numerical simulations sustain the effectiveness of the proposed algorithm.
More Related Videos
09:06High-throughput Identification of Gene Regulatory Sequences Using Next-generation Sequencing of Circular Chromosome Conformation Capture 4C-seq
Published on: October 5, 2018
09:34Synthesis of Information-bearing Peptoids and their Sequence-directed Dynamic Covalent Self-assembly
Published on: February 6, 2020
Related Concept Videos
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Sanger Sequencing
RACE - Rapid Amplification of cDNA Ends
Sequences
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...