DocumentCode :
3174832
Title :
Speeding up dynamic programming
Author :
Eppstein, David ; Galil, Zvi ; Giancarlo, Raffaele
Author_Institution :
Dept. of Comput. Sci., Columbia Univ., NY, USA
fYear :
1988
fDate :
24-26 Oct 1988
Firstpage :
488
Lastpage :
496
Abstract :
A number of important computational problems in molecular biology, geology, speech recognition, and other areas can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, the authors speed up the computation of several of these recurrences by one or two orders of magnitude. The algorithms used are simple and practical
Keywords :
computational complexity; dynamic programming; algorithms; computational problems; data structures; dynamic programming; geology; molecular biology; speech recognition; Binary search trees; Biology computing; Computational biology; Computer science; Computer science education; Data structures; Dynamic programming; Educational programs; Geology; Speech recognition;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1988., 29th Annual Symposium on
Conference_Location :
White Plains, NY
Print_ISBN :
0-8186-0877-3
Type :
conf
DOI :
10.1109/SFCS.1988.21965
Filename :
21965
Link To Document :
بازگشت