Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

An algorithm for approximate tandem repeats.

G M Landau1, J P Schmidt, D Sokol

  • 1Department of Computer Science, Haifa University, Haifa 31905, Israel. landau@poly.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|May 8, 2001
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Human activities shape global patterns of decomposition rates in rivers.

Science (New York, N.Y.)·2024
Same author

[Bilateral Dorsal Fracture-Dislocation of the Proximal Humerus].

Acta chirurgiae orthopaedicae et traumatologiae Cechoslovaca·2024
Same author

Characteristics of the 100 largest modern zoonotic disease outbreaks.

Philosophical transactions of the Royal Society of London. Series B, Biological sciences·2021
Same author

Surgical malpractice - the barrister's perspective.

Annals of the Royal College of Surgeons of England·2021
Same author

What factors explain the geographical range of mammalian parasites?

Proceedings. Biological sciences·2019
Same author

Clinical deterioration despite syringomyelia resolution after successful foramen magnum decompression for Chiari malformation - Case series.

European journal of paediatric neurology : EJPN : official journal of the European Paediatric Neurology Society·2019
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

This study introduces algorithms for finding approximate tandem repeats in biological sequences, crucial for understanding genomic diseases. The methods efficiently identify repeats with errors using Hamming or edit distances.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Tandem repeats, both perfect and approximate, are significant in biological sequences.
  • Understanding these repeats is vital for identifying disease-related genetic variations.

Purpose of the Study:

  • To develop efficient algorithms for detecting approximate multiple tandem repeats in sequences.
  • To precisely define and identify repeats with errors, considering Hamming and edit distances.

Main Methods:

  • Algorithms designed to find approximate single and multiple tandem repeats.
  • Utilizing Hamming distance (k mismatches) and edit distance (k differences) for similarity.
  • Time complexity analysis for identified algorithms: O(nk log (n/k)) for Hamming, O(nk log k log (n/k)) for edit distance, and O(nka log (n/k)) for multiple repeats.

Related Experiment Videos

Main Results:

  • Efficient algorithms are presented for identifying approximate tandem repeats with specified error thresholds.
  • The algorithms report locally optimal approximate repeats based on defined similarity criteria.
  • Experimental results demonstrate the performance and sensitivity of the developed algorithms.

Conclusions:

  • The developed algorithms provide effective tools for discovering approximate tandem repeats in biological sequences.
  • Accurate identification of these repeats can aid in the study of genetic diseases.
  • The research contributes to the computational problem of finding repeats with significant implications in molecular biology.