New Genome Sequence Detection via Natural Vector Convex Hull Method.

Area of Science:

• Bioinformatics
• Computational Biology
• Genomics

Background:

• Detecting novel genome sequence mutations is difficult and resource-intensive using traditional experimental methods.
• Existing mathematical approaches for identifying new genome mutations are limited.
• There is a need for efficient computational strategies to discover undiscovered genome sequences.

Purpose of the Study:

• To develop novel mathematical approaches for detecting new, undiscovered genome sequences.
• To establish a robust framework for alignment-free sequence analysis.
• To computationally identify novel genome sequences, reducing reliance on expensive biological experiments.

Main Methods:

• Developed a new framework based on the natural vector convex hull method for alignment-free sequence analysis.
• Introduced two novel algorithms: Random-permutation Algorithm with Penalty (RAP) and Random-permutation Algorithm with Penalty and COstrained Search (RAPCOS).
• Utilized geometric properties captured by natural vectors within the algorithms.

Main Results:

• Successfully discovered a mathematically new human immunodeficiency virus (HIV) genome sequence using real sequence data.
• Demonstrated the applicability of the proposed methods to the challenge of new genome sequence detection.
• Validated the robustness, rapid convergence, and fast computation of the RAP and RAPCOS algorithms.

Conclusions:

• The developed mathematical framework and algorithms provide an effective solution for detecting new genome sequences.
• These computational methods offer a resource-efficient alternative to experimental approaches for genome discovery.
• The RAP and RAPCOS algorithms show significant promise for advancing genomic research and mutation detection.