A New Algorithm For Ssr Detection (Ssrs Finder)

Document Type : Original Article

Authors

Management Information System, Higher Institute of Computer and Information Technology, Cairo, Egypt

Abstract

One of the main challenges with bioinformatics software is that the size and complexity of datasets necessitate trading speed for accuracy, or completeness. To combat this problem of computational complexity, a plethora of heuristic algorithms have arisen that report a ‘good enough’ solution to biological questions. However, in instances such as Simple Sequence Repeats (SSRs), a ‘good enough’ solution may not accurately portray results in population genetics, phylogenetics and forensics, which require accurate SSRs to calculate intra- and inter-species interactions. And so, Biotechnologists took a lot of time to identify similar sequences on a DNA. In addition, the accuracy of the results was an important problem. In order to overcome this problem, biotechnologists need a modern hardware and equipment for the program to function efficiently. We proposed the SSRs finder application that detects the existing SSRs by determining the start and the stop, the min and the max and prepares a comparison between the old SSRs with the new SSRs then records the results and shows them in the quarry with high accuracy and speed.

Keywords

Main Subjects

Files

Share

How to cite

Statistics