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 systematic approach to dynamic programming in bioinformatics.

R Giegerich1

  • 1Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany. robert@techfak.uni-bielefeld.de

Bioinformatics (Oxford, England)
|December 1, 2000
PubMed
Summary

This study presents a systematic method for developing dynamic programming algorithms in biosequence analysis. It simplifies algorithm construction and prototyping, improving efficiency for bioinformatics tasks.

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

Thermodynamic matchers: strengthening the significance of RNA folding energies.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2007
Same author

Minimum conflict: a divide-and-conquer approach to phylogeny estimation.

Bioinformatics (Oxford, England)·2001
Same author

REPuter: the manifold applications of repeat analysis on a genomic scale.

Nucleic acids research·2001
Same author

Computation and visualization of degenerate repeats in complete genomes.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same author

Prediction and visualization of structural switches in RNA.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·1999
Same author

RNA movies: visualizing RNA secondary structure spaces.

Bioinformatics (Oxford, England)·1999

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Algorithm Development

Background:

  • Dynamic programming is a widely used technique in bioinformatics for problems like sequence comparison and gene recognition.
  • Developing dynamic programming algorithms is currently challenging, relying on expertise and often leading to complex implementations.
  • There is a lack of general, problem-independent guidance for constructing these algorithms.

Purpose of the Study:

  • To introduce a systematic and general method for constructing dynamic programming solutions in biosequence analysis.
  • To simplify the development process of complex dynamic programming algorithms.
  • To provide a structured approach for deriving correct recurrence relations.

Main Methods:

  • A conceptual splitting of dynamic programming algorithms into distinct recognition and evaluation phases.

Related Experiment Videos

  • Systematic derivation of recurrence relations through this phased approach.
  • Implementation of an early, executable prototype using a functional programming language.

    • Main Results:

    • The proposed method significantly simplifies the construction of dynamic programming algorithms for biosequence analysis.
    • Correct recurrence relations can be systematically derived, reducing implementation errors.
    • The method facilitates the creation of executable prototypes without compromising ultimate program efficiency.

    Conclusions:

    • This systematic approach enhances the development of dynamic programming algorithms in bioinformatics.
    • The method is broadly applicable to various biosequence analysis problems.
    • It reduces programming effort and complexity while maintaining computational efficiency.