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

A branch and bound algorithm for local multiple alignment

P Horton1

  • 1Computer Science Division, University of California, Berkeley 94720, USA.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|January 1, 1996
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

Heterogeneity in chloroplast photosystem II.

Photosynthesis research·2014
Same author

Observation of enhancement and state transitions in isolated intact chloroplasts.

Photosynthesis research·2014
Same author

Observation and characterisation of a transient in the yield of chlorophyll fluorescence in intact spinach chloroplasts.

Photosynthesis research·2014
Same author

Characterisation of the effects of Antimycin A upon high energy state quenching of chlorophyll fluorescence (qE) in spinach and pea chloroplasts.

Photosynthesis research·2014
Same author

Generation of oscillatory behavior in the Laisk model of photosynthetic carbon assimilation.

Photosynthesis research·2014
Same author

Non-photochemical quenching of chlorophyll fluorescence in the green alga Dunaliella.

Photosynthesis research·2014
Same journal

Trust, Reproducibility, and Progress: The Roles of Independent Blind Prediction and Assessment and Benchmarking in Computational Biology.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

The Evolving Cyberinfrastructure at the National Institutes of Health to Support Data and AI in Biomedical Research.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Applications of AI & ML in Biomanufacturing of Cell and Gene Therapies.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

AI for Health: Leveraging Artificial Intelligence to Revolutionize Healthcare.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Workshop Introduction: Advances of AI Methods in Single Cell Spatial Omics.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

DRIVE-KG: Enhancing variant-phenotype association discovery in understudied complex diseases using heterogeneous knowledge graphs.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
See all related articles

A new Branch and Bound algorithm optimizes sequence window positions for maximal information content. This computational method surpasses heuristic approaches, enabling optimal solutions for complex sequence analysis problems.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Algorithm Development

Background:

  • Sequence analysis is crucial in bioinformatics.
  • Identifying optimal window positions is computationally challenging.
  • Existing methods often rely on heuristics, limiting solution optimality.

Purpose of the Study:

  • To develop an efficient algorithm for finding optimal window positions in sequence compilations.
  • To maximize the global information content within selected windows.
  • To provide a method for solving previously intractable sequence analysis problems.

Main Methods:

  • A novel Branch and Bound algorithm was designed for optimal window selection.
  • A refined brute force algorithm was developed for solution evaluation, improving efficiency.

Related Experiment Videos

  • The algorithms were combined to achieve optimal results for sequence information content maximization.

    • Main Results:

    • The Branch and Bound algorithm successfully identifies globally maximal information content window positions.
    • The enhanced brute force algorithm offers significant speed improvements over naive methods.
    • The combined approach enables the optimal solution of problems previously limited to heuristic approximations.

    Conclusions:

    • The developed algorithms provide a powerful tool for sequence analysis.
    • Optimal solutions for information content maximization in sequence compilations are now achievable.
    • This work advances computational methods in bioinformatics and sequence data interpretation.