Kmer-SSR: a fast and exhaustive SSR search algorithm
Novelty of Approach
-Identifies all SSRs
-Allows for complex filtering of SSRs
1. Identify SSRs from left to right
2. Identify SSRs with the largest period size first
3. Create a Boolean filter array
Results
-Guaranteed to identify all SSRs
-Linear time SSR identification
-Provides options for a truly exhaustive SSR search
-Faster than almost all other algorithms
Implications
-Phylogenetics and species identification
-Enables faster SSR pipelines and SSR analyses