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

Versatile and declarative dynamic programming using pair algebras.

Peter Steffen1, Robert Giegerich

  • 1Faculty of Technology, Bielefeld University, Postfach 10 01 31, 33501 Bielefeld, Germany. psteffen@techfak.uni-bielefeld.de

BMC Bioinformatics
|September 15, 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

[Treatment of cancer-related pain-From pharmacotherapy to invasive procedures].

Die Anaesthesiologie·2024
Same author

[Analgesic Drug Therapy in Kidney Patients].

Deutsche medizinische Wochenschrift (1946)·2021
Same author

Bee Stings and Chronic Pain Disorder.

Cureus·2018
Same author

The BRaliBase dent-a tale of benchmark design and interpretation.

Briefings in bioinformatics·2016
Same author

Pareto optimization in algebraic dynamic programming.

Algorithms for molecular biology : AMB·2015
Same author

Ambivalent covariance models.

BMC bioinformatics·2015
Same journal

Covariance decomposition for distance based species tree estimation.

BMC bioinformatics·2026
Same journal

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026
Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
See all related articles

Algebraic dynamic programming simplifies complex bioinformatics algorithms by separating recurrences and scoring schemes. A new product operation enhances flexibility, enabling diverse applications like RNA secondary structure prediction with less programming effort.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Algorithm Design

Background:

  • Dynamic programming is essential in bioinformatics but complex to implement for novel applications.
  • Textbook examples of dynamic programming are often oversimplified.
  • The algebraic dynamic programming approach separates recurrences and scoring schemes to ease implementation.

Purpose of the Study:

  • To introduce a generic product operation for scoring schemes within the algebraic dynamic programming framework.
  • To enhance the flexibility and applicability of dynamic programming in bioinformatics.
  • To reduce programming effort for complex dynamic programming tasks.

Main Methods:

  • Developed a generic product operation for scoring schemes based on the algebraic dynamic programming approach.

Related Experiment Videos

  • Applied the method to various applications, including RNA secondary structure prediction.
  • Demonstrated the ability to handle multiple objective functions, alternative solutions, and ambiguity checking.

    • Main Results:

    • The product operation allows for optimizations under multiple objectives and facilitates alternative solutions and backtracing.
    • Enables holistic search space analysis and ambiguity checking without extra programming.
    • Successfully applied to RNA secondary structure prediction, showcasing versatility.

    Conclusions:

    • The introduced product operation significantly increases the flexibility of dynamic programming.
    • Provides a versatile platform for developing and implementing new algorithmic ideas.
    • Facilitates practical application of advanced algorithmic concepts in bioinformatics.