PERF: an exhaustive algorithm for ultra-fast and efficient identification of microsatellites from large DNA sequences | Zendy

Akshay Kumar Avvaru | Zendy; Divya Tej Sowpati | Zendy; Rakesh K. Mishra | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

PERF: an exhaustive algorithm for ultra-fast and efficient identification of microsatellites from large DNA sequences

Author(s) -

Akshay Kumar Avvaru,

Divya Tej Sowpati,

Rakesh K. Mishra

Publication year - 2017

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btx721

Subject(s) - computer science , python (programming language) , microsatellite , source code , mit license , algorithm , identification (biology) , programming language , software , biology , genetics , gene , allele , botany

Microsatellites or Simple Sequence Repeats (SSRs) are short tandem repeats of DNA motifs present in all genomes. They have long been used for a variety of purposes in the areas of population genetics, genotyping, marker-assisted selection and forensics. Numerous studies have highlighted their functional roles in genome organization and gene regulation. Though several tools are currently available to identify SSRs from genomic sequences, they have significant limitations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research