You're using an outdated browser. Please upgrade to a modern browser for the best experience.
Improved algorithm for indels detection: History
Please note this is an old version of this entry, which may differ significantly from the current revision.
Contributor: Done Stojanov

The article "TMO: Time and Memory Optimized Algorithm Applicable for More Accurate Alignment of Trinucleotide Repeat Disorders Associated Genes" introduces a novel algorithm designed to enhance the detection of insertion/deletions (indels) in genes associated with trinucleotide repeat disorders, such as Huntington's disease.

Main features:

  1. Enhanced Detection of Indels: The TMO algorithm outperforms traditional methods, like the Smith-Waterman algorithm, by more accurately identifying continuous indels in gene fragments linked to disorders caused by trinucleotide repeat expansions.
  2. Improved Alignment Accuracy: By maximizing the number of matching nucleotides per alignment, the TMO algorithm provides a more precise model for understanding the relationship between trinucleotide repeat disorders and spliced mRNA.
  3. Computational Efficiency: The algorithm demonstrates reduced time and memory requirements compared to traditional methods, making it suitable for large-scale genomic analyses.
  • alignment
  • algorithm
  • accurate
  • indels
  • detection
  • trinucleotide
  • repeat
  • disorder

The key findings of the paper "TMO: Time and Memory Optimized Algorithm Applicable for More Accurate Alignment of Trinucleotide Repeat Disorders Associated Genes" are:

  1. Improved Accuracy of Alignment: The TMO (Time and Memory Optimized) algorithm provides a more accurate alignment for genes associated with trinucleotide repeat disorders by effectively identifying and handling insertion/deletions (indels) in these gene sequences.
  2. Efficient Detection of Trinucleotide Repeat Expansions: The algorithm significantly enhances the detection of expansions of trinucleotide repeats, a critical feature in disorders like Huntington’s disease, by aligning gene sequences with greater precision.
  3. Optimized Computational Efficiency: TMO optimizes both time and memory usage, offering better performance than traditional algorithms like Smith-Waterman. This makes it particularly useful for large-scale genomic analyses, where computational efficiency is crucial.
  4. Higher Matching Accuracy: The algorithm ensures more matching nucleotides per alignment, thereby improving the quality and reliability of gene alignments. This is important for understanding the genetic basis of trinucleotide repeat disorders.
  5. Scalability for Large Data Sets: TMO is designed to handle large genomic data sets, making it suitable for high-throughput studies that require analyzing multiple gene sequences associated with various genetic disorders.

In summary, the TMO algorithm offers a more accurate and efficient approach for aligning genes associated with trinucleotide repeat disorders, facilitating better understanding and potential diagnostic applications.

[1]

This entry is adapted from: https://doi.org/10.1080/13102818.2015.1114428

References

  1. Done Stojanov; Sašo Koceski; Aleksandra Mileva; Nataša Koceska; Cveta Martinovska Bande; Towards computational improvement of DNA database indexing and short DNA query searching. Biotechnol. Biotechnol. Equip. 2014, 28, 958-967, .
More
This entry is offline, you can click here to edit this entry!
Academic Video Service