A systematic approach to dynamic programming in bioinformatics

Giegerich R (2000)
BIOINFORMATICS 16(8): 665-677.

Journal Article | Published | English

No fulltext has been uploaded

Abstract
Motivation: Dynamic programming is probably the most popular programming method in bioinformatics. Sequence comparison gene recognition, RNA structure prediction and hundreds of other problems are solved by ever new variants of dynamic programming. Currently, the development of a successful dynamic programming algorithm is a matter of experience, talent and luck. The typical matrix recurrence relations that make up a dynamic programming algorithm are intricate to construct, and difficult to implement reliably No general problem independent guidance is available. Results: This article introduces a systematic method for constructing dynamic programming solutions to problems in biosequence analysis. By a conceptual splitting of the algorithm into a recognition and an evaluation phase, algorithm development is simplified considerably, and correct recurrences can be derived systematically. Without additional effort, the method produces an early, executable prototype expressed in a functional programming language. The method is quite generally applicable, and, while programming effort decreases, no overhead in terms of ultimate program efficiency is incurred.
Publishing Year
ISSN
eISSN
PUB-ID

Cite this

Giegerich R. A systematic approach to dynamic programming in bioinformatics. BIOINFORMATICS. 2000;16(8):665-677.
Giegerich, R. (2000). A systematic approach to dynamic programming in bioinformatics. BIOINFORMATICS, 16(8), 665-677.
Giegerich, R. (2000). A systematic approach to dynamic programming in bioinformatics. BIOINFORMATICS 16, 665-677.
Giegerich, R., 2000. A systematic approach to dynamic programming in bioinformatics. BIOINFORMATICS, 16(8), p 665-677.
R. Giegerich, “A systematic approach to dynamic programming in bioinformatics”, BIOINFORMATICS, vol. 16, 2000, pp. 665-677.
Giegerich, R.: A systematic approach to dynamic programming in bioinformatics. BIOINFORMATICS. 16, 665-677 (2000).
Giegerich, Robert. “A systematic approach to dynamic programming in bioinformatics”. BIOINFORMATICS 16.8 (2000): 665-677.
This data publication is cited in the following publications:
This publication cites the following data publications:

7 Citations in Europe PMC

Data provided by Europe PubMed Central.

Transmembrane protein alignment and fold recognition based on predicted topology.
Wang H, He Z, Zhang C, Zhang L, Xu D., PLoS ONE 8(7), 2013
PMID: 23894534
DOPA: GPU-based protein alignment using database and memory access optimizations.
Hasan L, Kentie M, Al-Ars Z., BMC Res Notes 4(), 2011
PMID: 21798061
Structural analysis of aligned RNAs.
Voss B., Nucleic Acids Res. 34(19), 2006
PMID: 17020924
Design optimization methods for genomic DNA tiling arrays.
Bertone P, Trifonov V, Rozowsky JS, Schubert F, Emanuelsson O, Karro J, Kao MY, Snyder M, Gerstein M., Genome Res. 16(2), 2006
PMID: 16365382
Fast and effective prediction of microRNA/target duplexes.
Rehmsmeier M, Steffen P, Hochsmann M, Giegerich R., RNA 10(10), 2004
PMID: 15383676

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Sources

PMID: 11099253
PubMed | Europe PMC

Search this title in

Google Scholar