Kmer-SSR: a fast and exhaustive SSR search algorithm

Area of Science:

• Bioinformatics
• Computational Biology
• Genomics

Background:

• Bioinformatics software faces challenges with large datasets, often requiring a trade-off between speed and accuracy.
• Heuristic algorithms provide approximate solutions, which can be insufficient for applications like population genetics and phylogenetics requiring precise Simple Sequence Repeats (SSRs) identification.
• Accurate SSR identification is crucial for understanding intra- and inter-species interactions in various biological fields.

Purpose of the Study:

• To develop a fast, accurate, and user-friendly tool for identifying all SSRs.
• To overcome the limitations of heuristic algorithms in SSR detection.
• To provide enhanced capabilities for analyzing biologically relevant SSRs.

Main Methods:

• Introduction of Kmer-SSR, a parallelized algorithm for SSR identification.
• Implementation of an exhaustive search option ensuring 100% precision and recall.
• Development of user-defined filters to refine SSR identification based on biological relevance.

Main Results:

• Kmer-SSR identifies all SSRs faster than most existing heuristic algorithms.
• The exhaustive mode of Kmer-SSR achieves 100% precision and 100% recall.
• Integrated filters allow for intuitive and rapid identification of biologically pertinent SSRs.

Conclusions:

• Kmer-SSR offers a significant improvement in speed and accuracy for SSR identification.
• The tool provides a user-friendly interface with flexible filtering options.
• Kmer-SSR enhances the analysis of genetic variation and interactions through precise SSR detection.