Back

Development and Application of a Novel Simple Sequence Repeat Mining Algorithm Based on Regular Expression

Jia, Z.; Geng, R.; Wu, X.; Chen, S.; Tong, Y.; Yang, A.; Luo, C.; Ren, M.

2022-06-02 bioinformatics
10.1101/2022.06.01.494292 bioRxiv
Show abstract

Simple sequence repeats (SSRs) are molecular genetic markers that are powerful tools in genomics studies; SSR markers are routinely mined as a part of genetic workflows. Here, we developed a novel SSR mining algorithm based on regular expression that can reduce the complexity of commonly used SSR mining software. We used the following SSR mining regular expression: ({i, j}?) (\1) {k}, where i and j denote the minimum and maximum lengths of the motifs of the SSR sequence, respectively, and k is the minimum number of repeat motifs. From this SSR mining algorithm, we developed an SSR sequence analysis software (named "regexSSRw") that is capable of mining eligible SSR loci from FASTA format sequences; regexSSRw can be accessed at https://github.com/renm79/rgxSSRw. This SSR mining algorithm can aid a range of applications, from being used by programmers in the development of SSR mining software to being implemented by scholars into their SSR marker workflow.

Matching journals

The top 9 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.