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

Structured motifs search.

Michele Morgante1, Alberto Policriti, Nicola Vitacolonna

  • 1Department of Crop Sciences and Agricultural Engineering, via delle Scienze 206, 33100 Udine, Italy.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|October 26, 2005
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

Self-organizing maps for allele specific expression data reconstruction and identification of anomalous genomic regions.

Frontiers in bioinformatics·2026
Same author

Genomic resources for two apex avian predators from Saudi Arabia: Falco biarmicus and Falco peregrinus.

G3 (Bethesda, Md.)·2026
Same author

A two-phase clustering procedure based on allele specific expression.

BMC bioinformatics·2026
Same author

Transposable elements drive evolution and perturb gene expression in Brassica rapa and B. oleracea.

The Plant journal : for cell and molecular biology·2025
Same author

PacBio genome assembly of Olea europaea L. subsp. europaea cultivars Frantoio and Leccino.

Scientific data·2025
Same author

Grape ripening speed slowed down using natural variation.

TAG. Theoretical and applied genetics. Theoretische und angewandte Genetik·2025
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 an efficient algorithm for localizing structured models using pattern matching and constraint satisfaction. It uniquely handles partial matches and represents solutions compactly as a graph, improving efficiency.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Algorithm Design

Background:

  • Localization of structured models, sequences of motifs and constraints, is crucial in various scientific domains.
  • Existing tools often struggle with partial matches and efficient representation of numerous solutions.

Purpose of the Study:

  • To present a novel algorithm for localizing structured models.
  • To enhance efficiency by incorporating pattern matching with constraint satisfaction.
  • To enable the search for partial matches, a capability lacking in similar tools.

Main Methods:

  • The algorithm combines standard pattern matching procedures with a constraint satisfaction solver.
  • It is designed to identify sequences of motifs and distance constraints.

Related Experiment Videos

  • Solutions are represented in a compact graph format.

    • Main Results:

    • The algorithm successfully localizes structured models, including partial matches.
    • The graph representation efficiently handles potentially exponentially many solutions.
    • Graph construction time and space complexity are linear to the number of component pattern occurrences.

    Conclusions:

    • This approach offers an efficient and versatile method for structured model localization.
    • The compact graph representation and ability to find partial matches represent significant advancements.
    • The algorithm's linear complexity ensures scalability for practical applications.