SA-SSR: a suffix array-based algorithm for exhaustive and efficient SSR discovery in large genetic sequences
B D Pickett1, S M Karlinsey1, C E Penrod1
1Department of Biology, Brigham Young University, Provo, UT 84602, USA.
Unlabelled:
Simple Sequence Repeats (SSRs) are used to address a variety of research questions in a variety of fields (e.g. population genetics, phylogenetics, forensics, etc.), due to their high mutability within and between species. Here, we present an innovative algorithm, SA-SSR, based on suffix and longest common prefix arrays for efficiently detecting SSRs in large sets of sequences. Existing SSR detection applications are hampered by one or more limitations (i.e. speed, accuracy, ease-of-use, etc.). Our algorithm addresses these challenges while being the most comprehensive and correct SSR detection software available. SA-SSR is 100% accurate and detected >1000 more SSRs than the second best algorithm, while offering greater control to the user than any existing software.
Availability And Implementation:
SA-SSR is freely available at http://github.com/ridgelab/SA-SSR CONTACT: perry.ridge@byu.edu
Supplementary Information:
Supplementary data are available at Bioinformatics online.
Related Concept Videos
Sanger Sequencing
RNA-seq
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while...
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Single Nucleotide Polymorphisms-SNPs


