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 efficient algorithm for finding short approximate non-tandem repeats.

E F Adebiyi1, T Jiang, M Kaufmann

  • 1Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, Tübingen, 72076, Germany. adebiyi@informatik.uni-tuebingen.de

Bioinformatics (Oxford, England)
|July 27, 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

[Risk factors for an extended hospital stay after elective minimally invasive colonic surgery in Germany-Data analysis of the StuDoQ register].

Chirurgie (Heidelberg, Germany)·2026
Same author

Immune checkpoint inhibitors therapy for solid organ malignancies after allogeneic hematopoietic stem cell transplantation: a retrospective study from the EBMT Transplant Complications Working Party.

Bone marrow transplantation·2024
Same author

Investigating non-inferiority of internet-delivered versus face-to-face cognitive behavioural therapy for insomnia (CBT-I): a randomised controlled trial (iSleep well).

Trials·2024
Same author

Infantile hypercalcemia type 1 (HCINF1): a rare disease resulting in nephrolithiasis and nephrocalcinosis caused by mutations in the vitamin D catabolic enzyme, CYP24A1.

Journal of endocrinological investigation·2024
Same author

Long-term trajectories of densely reported depressive symptoms during an extended period of the COVID-19 pandemic in Switzerland: Social worries matter.

Comprehensive psychiatry·2024
Same author

Correction to: Two-stage laparoscopic transversus abdominis plane block as an equivalent alternative to thoracic epidural anaesthesia in bowel resection-an explorative cohort study.

International journal of colorectal disease·2024
Same journal

Biomedical Concept Recognition with Error-aware Negative-enhanced Ranking Framework.

Bioinformatics (Oxford, England)·2026
Same journal

TEDLH: Domain HMMs for sensitive detection of remote homologues.

Bioinformatics (Oxford, England)·2026
Same journal

PLNFGL: Joint Estimation of Multi-Condition Gene Networks from Single-cell RNA-seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
See all related articles

This study introduces an efficient algorithm for finding approximate repeats in long sequences, crucial for biological data analysis. The method significantly speeds up the identification of repeating patterns with variations like insertions, deletions, and mismatches.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Stringology

Background:

  • Identifying repeating patterns in biological sequences is fundamental for understanding genome structure and function.
  • Existing methods often struggle with approximate repeats, which include variations like insertions, deletions, and mismatches.

Purpose of the Study:

  • To develop an efficient algorithm for extracting approximate non-tandem repeats from long biological sequences.
  • To theoretically characterize the 'seeds' or maximal exact repeats required for approximate repeat detection.

Main Methods:

  • The algorithm leverages a theoretical characterization of maximal exact repeats (seeds).
  • It employs a sub-quadratic approach to identify short approximate repeats within a given threshold of differences.

Related Experiment Videos

  • The analysis focuses on sequences of length P with at most D differences.

    • Main Results:

    • A sublinear bound on the expected number of required seeds was proven.
    • An efficient sub-quadratic algorithm was presented for finding approximate repeats of length O(log N).
    • The algorithm's running time is O(DN(3pow(epsilon)-1)log N), where epsilon = D/P.

    Conclusions:

    • The developed algorithm provides a significant advancement in efficiently detecting approximate repeats in large biological datasets.
    • This method is particularly relevant for analyzing DNA and protein sequences where variations are common.