A systematic approach to dynamic programming in bioinformatics | Zendy

Robert Giegerich | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A systematic approach to dynamic programming in bioinformatics

Author(s) -

Robert Giegerich

Publication year - 2000

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/16.8.665

Subject(s) - executable , computer science , dynamic programming , procedural programming , construct (python library) , inductive programming , reactive programming , programming paradigm , algorithm , programming language , artificial intelligence

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research