SA-SSR: a suffix array-based algorithm for exhaustive and efficient SSR discovery in large genetic sequences
2016
Pickett, B. D. | Karlinsey, S. M. | Penrod, C. E. | Cormier, M. J. | Ebbert, M. T. W. | Shiozawa, D. K. | Whipple, C. J. | Ridge, P. G.
Summary: 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: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.
显示更多 [+] 显示较少 [-]