ACM International Conference Proceeding Series, Pages 426-429 , 20/12/2019
A linear time algorithm for finding tandem repeat in DNA sequences
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.
Document Type
Conference Paper
Source Type
Conference Proceeding
ISBN
[9781450376631]
ISSN
Keywords
DNA sequencesLongest previous non-overlapping factorSuffix trayTandem repeat
ASJC Subject Area
Computer Science : SoftwareComputer Science : Computer Networks and CommunicationsComputer Science : Human-Computer InteractionComputer Science : Computer Vision and Pattern Recognition