SA-SSR: A suffix array-based algorithm for exhaustive and efficient SSR discovery in large genetic sequences

15Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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

Cite

CITATION STYLE

APA

Pickett, B. D., Karlinsey, S. M., Penrod, C. E., Cormier, M. J., Ebbert, M. T. W., Shiozawa, D. K., … Ridge, P. G. (2016). SA-SSR: A suffix array-based algorithm for exhaustive and efficient SSR discovery in large genetic sequences. In Bioinformatics (Vol. 32, pp. 2707–2709). Oxford University Press. https://doi.org/10.1093/bioinformatics/btw298

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free