Abstract

Tandem repeats cause several genetic diseases in humans and play an essential role in DNA fingerprinting for paternity analysis, forensic investigations, tracing the evolution of populations, and disease diagnosis. However, the process of tandem repeat detection in DNA sequences takes time and requires significant computational memory. To improve the efficiency of this process, we present an algorithm that runs in linear time toward finding tandem repeats in DNA sequences with the Longest Previous non-overlapping Factor (LPnF) table and use the suffix tray data structure.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call