Reconstruction of sequence from its circular partial sums for cyclopeptide sequencing problem

Area of Science:

• Computational Biology
• Bioinformatics
• Mathematical Biology

Background:

• The cyclopeptide sequencing problem emerged in computational biology for de novo peptide sequencing.
• This problem is mathematically equivalent to the one-dimensional beltway problem, involving reconstructing point coordinates from circular pairwise distances.
• The beltway problem is a complex computational challenge, not definitively NP-complete nor solvable in polynomial time.

Purpose of the Study:

• To develop an efficient algorithm for solving the cyclopeptide sequencing problem.
• To leverage sequence element information to enhance the accuracy and scope of peptide reconstruction.
• To address a fundamental problem in computational biology with a novel algorithmic approach.

Main Methods:

• Developed a novel algorithm specifically designed for cyclopeptide sequencing.
• The algorithm incorporates information about potential sequence elements to guide reconstruction.
• Utilized numerical simulations to validate the algorithm's performance and effectiveness.

Main Results:

• The proposed algorithm demonstrates efficiency in solving the cyclopeptide sequencing problem.
• Successfully restored cyclic peptide sequences with lengths up to 160 elements.
• Numerical simulations confirmed the algorithm's effectiveness.

Conclusions:

• The developed algorithm provides an effective solution for cyclopeptide sequencing.
• This advancement contributes to the field of de novo peptide sequencing in computational biology.
• The method's ability to handle longer sequences represents a significant step forward.