TMO: time and memory optimized algorithm applicable for more accurate alignment of trinucleotide repeat disorders associated genes

Stojanov, Done and Madevska Bogdanova, Ana and Orzechowski, Tomasz (2016) TMO: time and memory optimized algorithm applicable for more accurate alignment of trinucleotide repeat disorders associated genes. Biotechnology & Biotechnological Equipment, 30 (2). pp. 388-403. ISSN 1310-2818

[img]
Preview
Text
TMO time and memory optimized algorithm applicable for more accurate alignment of trinucleotide repeat disorders associated genes.pdf - Published Version

Download (1165Kb) | Preview
Official URL: http://www.tandfonline.com/toc/tbeq20/30/2

Abstract

In this study, time and memory optimized (TMO) algorithm is presented. Compared with SmithWaterman’s algorithm, TMO is applicable for a more accurate detection of continuous insertion/deletions (indels) in genes’ fragments, associated with disorders caused by overrepetition of a certain codon. The improvement comes from the tendency to pinpoint indels in the least preserved nucleotide pairs. All nucleotide pairs that occur less frequently are classified as less preserved and they are considered as mutated codons whose mid-nucleotides were deleted. Other benefit of the proposed algorithm is its general tendency to maximize the number of matching nucleotides included per alignment, regardless of any specific alignment metrics. Since the structure of the solution, when applying SmithWaterman, depends on the adjustment of the alignment parameters and, therefore, an incomplete (shortened) solution may be derived, our algorithm does not reject any of the consistent matching nucleotides that can be included in the final solution. In terms of computational aspects, our algorithm runs faster than SmithWaterman for very similar DNA and requires less memory than the most memory efficient dynamic programming algorithms. The speed up comes from the reduced number of nucleotide comparisons that have to be performed, without having to imperil the completeness of the solution. Due to the fact that four integers (16 Bytes) are required for tracking matching fragment, regardless its length, our algorithm requires less memory than Huang’s algorithm.

Item Type: Article
Subjects: Natural sciences > Biological sciences
Natural sciences > Computer and information sciences
Divisions: Faculty of Computer Science
Depositing User: Done Stojanov
Date Deposited: 12 Apr 2016 09:47
Last Modified: 12 Apr 2016 09:47
URI: http://eprints.ugd.edu.mk/id/eprint/15735

Actions (login required)

View Item View Item