Abstract

Repetitive DNA is vital in genetics, particularly in tandem repeats linked to specific genetic disorders and diseases. Identifying duplicate elements within a genome is typically time-consuming and resource-intensive. In response to this challenge, this paper presents an algorithm designed for web applications, which efficiently detects duplicate DNA sequences while operating within linear time and using linear memory space. This algorithm capitalizes on utilizing the Longest Previous non-overlapping Factor (LPnF) table and the suffix tray data structure. The web application in question excels at precisely identifying repeated patterns within genome sequences and expeditiously delivering results. Furthermore, its user-friendly interface simplifies data input and facilitates the visualization of results.