David Eppstein, Zvi Galil, Raffaele Giancarlo  Home/Search
Context Related
Links: DBLP | uci.edu/~eppstein/...GalGiaFOCS88.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~eppstein/pubs/all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we consider the problem of computing two similar recurrences: the one-dimensional case (Update)
Context of citations to this paper: More
...the time requirement to O(jsj 3 ) 1 . This is further improved to O(jsj 2 log 2 jsj) for convex free energy functions by Eppstein et.al. [1]. A ne free energy functions (i.e. of the form a bn, where n is the size of the loop) allows for O(jsj 2 ) computation time by borrowing a...
.... various solutions to related problems, which also utilize Monge and Total Monotonicity properties, we refer the interested reader to [8] [9], 14] 15] 24] and [27] In order to eciently utilize these properties here, we need to address the following two problems. 1. How...
Cited by: More
A Sub-quadratic Sequence Alignment Algorithm for.. - Crochemore, Landau.. (2002) (Correct)
Computational Biology - Lyngsų (2000) (Correct)
An Improved Algorithm for RNA Secondary Structure Prediction - Lyngsų, Pedersen (1999) (Correct)
Similar documents (at the sentence level):
28.1%: Efficient Algorithms for Sequence Analysis with Concave and.. - Eppstein (1989) (Correct)
Active bibliography (related documents): More All
1.0: Efficient Algorithms for Sequence Analysis - Eppstein, Galil, Giancarlo.. (1991) (Correct)
0.3: Perspectives of Monge Properties in Optimization - Burkard, Klinz, Rudolf (1995) (Correct)
0.3: Discrete Pattern Matching Over Sequences And Interval Sets - Knight (1996) (Correct)
Similar documents based on text: More All
0.2: Fully Dynamic Planarity Testing with Applications - Galil, Italiano, Sarnak (Correct)
0.2: Efficient Comparison Based String Matching - Breslauer, Galil (1995) (Correct)
0.2: Separator-Based Sparsification II: Edge And Vertex.. - Eppstein, Galil.. (1998) (Correct)
Related documents from co-citation: More All
6: An improved algorithm for matching biological sequences (context) - Gotoh - 1982
5: Optimal Computer Folding of Large RNA Sequences Using Thermodynamic and Auxilary.. (context) - Zuker - 1981
4: Fast algorithm for predicting the secondary structure of single- stranded RNA (context) - Nussinov, Jacobson - 1980
BibTeX entry: (Update)
Eppstein, D., Galil, Z., and Giancarlo, R. Speeding up dynamic programming. Proc. 29th IEEE Symp. Found. Computer Science (1988), 488--496. http://citeseer.ist.psu.edu/eppstein88speeding.html More
@inproceedings{ eppstein88speeding,
author = "D. Eppstein and Z. Galil and R. Giancarlo",
title = "Speeding up dynamic programming",
booktitle = "Proceedings of the29th {IEEE} Annual Symposium on Foundations of Computer Science",
publisher = "IEEE Computer Society Press",
address = "White Plains, NY",
pages = "488--496",
year = "1988",
url = "citeseer.ist.psu.edu/eppstein88speeding.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
249 Volume 3: Sorting and Searching (context) - Knuth, of et al. - 1973
79 A Linear Space Algorithm for Computing Maximal Common Subseq.. (context) - Hirschberg - 1975 ACM DBLP
78 Software Practice and Experience (context) - Knuth, Plass et al. - 1981
60 Decomposable Searching Problems I: Static-to-Dynamic Transfo.. (context) - Bentley, Saxe - 1980 DBLP
57 Geometric Applications of a Matrix-Searching Algorithm (context) - Aggarwal, Klawe et al. - 1987 DBLP
51 Optimum Binary Search Trees (context) - Knuth - 1973
41 Preserving Order in a Forest in Less Than Logarithmic Time (context) - Boas - 1975 DBLP
38 and Macromolecules: The Theory and Practice of Sequence Comp.. (context) - Sanko, Kruskal et al. - 1983
32 Speeding Up Dynamic Programming with Applications to Molecul.. (context) - Galil, aele DBLP
31 RNA Secondary Structure: A Complete Mathematical Analysis (context) - Waterman, Smith - 1978
25 General Methods of Sequence Comparison (context) - Waterman - 1984
22 The Concave Least Weight Subsequence Problem Revisited (context) - Wilber
21 Data Structures and Network Algorithms (context) - Tarjan - 1985
19 Speed-up in Dynamic Programming (context) - Yao - 1982
19 The Least Weight Subsequence Problem (context) - Hirschberg, Larmore - 1987
18 Sequence Comparison with Concave Weighting Functions (context) - Miller, Myers
11 Optimal Sequence Alignment (context) - Fitch, Smith - 1983
6 Rapid Dynamic Programming Algorithms for RNA Secondary Struc.. (context) - Waterman, Smith - 1986 ACM
5 Fast Algorithms to Determine RNA Secondary Structures Contai.. (context) - Sanko, Kruskal et al. - 1983
3 New Stratigraphic Correlation Techniques (context) - Waterman, Smith - 1980
2 Speeding Up Dynamic Programming (context) - Klawe DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html): More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996) (Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999) (Correct)
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC