Sequence comparison with mixed convex and concave costs

doi:10.1016/0196-6774(90)90031-9

Journal of Algorithms

Volume 11, Issue 1, March 1990, Pages 85-101

https://doi.org/10.1016/0196-6774(90)90031-9 Get rights and content

Abstract

Recently a number of algorithms have been developed for solving the minimum-weight edit sequence problem with non-linear costs for multiple insertions and deletions. We extend these algorithms to cost functions that are neither convex nor concave, but a mixture of both. We also apply this technique to related dynamic programming algorithms.

References (14)

Z Galil et al.
Speeding up dynamic programming with application to molecular biology
Theoret. Comput. Sci.
(1989)
W Miller et al.
Sequence comparison with concave weighting functions
Bull. Math. Biol.
(1988)
M.S Waterman et al.
Rapid dynamic programming algorithms for RNA secondary structure
Adv. in Appl. Math.
(1986)
R Wilber
The concave least weight subsequence problem revisited
J. Algorithms
(1988)
A Aggarwal et al.
Geometric applications of a matrix-searching algorithm
Algorithmica
(1987)
A Aggarwal et al.
Searching in multidimensional monotone matrices
A.V Aho et al.
The Design and Analysis of Computer Algorithms
(1974)

There are more references available in the full text version of this article.

Cited by (52)

Minimum L<inf>k</inf> path partitioning-An illustration of the Monge property
2008, Operations Research Letters
Sparse LCS Common Substring Alignment
2003, Information Processing Letters
The “Common Substring Alignment” problem is defined as follows. The input consists of a set of strings S₁,S₂…,S_c, with a common substring appearing at least once in each of them, and a target string T. The goal is to compute similarity of all strings S_i with T, without computing the part of the common substring over and over again.
In this paper we consider the Common Substring Alignment problem for the LCS (Longest Common Subsequence) similarity metric. Our algorithm gains its efficiency by exploiting the sparsity inherent to the LCS problem. Let Y be the common substring, n be the size of the compared sequences, L_y be the length of the LCS of T and Y, denoted |LCS[T,Y]|, and L be max{|LCS[T,S_i]|}. Our algorithm consists of an O(nL_y) time encoding stage that is executed once per common substring, and an O(L) time alignment stage that is executed once for each appearance of the common substring in each source string. The additional running time depends only on the length of the parts of the strings that are not in any common substring.
A faster off-line algorithm for the TCP acknowledgement problem
2002, Information Processing Letters
In a recent paper [Proceedings of STOC'98, 1998, pp. 389–398], Dooly, Goldman and Scott study a problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgements in the Transmission Control Protocol (TCP). Among other results, they give an O(n²) off-line algorithm for computing the optimal way of acknowledging n packet arrivals and departures.
In this brief note, we observe that there is a faster off-line algorithm for this problem with time complexity O(n).
Monge strikes again: Optimal placement of web proxies in the internet
2000, Operations Research Letters
Citation Excerpt :
Indeed, let k⩾2 and assume that we already have computed all values F[j,k−1] with 1⩽j⩽n. For integers 0⩽j⩽i⩽n define the real-valued auxiliary function More general (and much more sophisticated) results on how to exploit Monge structures to speed up dynamic programming can be found in the work of Wilber [9], Eppstein [4], and Larmore and Schieber [6]. All the auxiliary values D[j], W[j], X[j], and Y[j] with 0⩽j⩽n can be computed in O(n) overall time.
In a recent paper (Proceedings of IFIP’98), Li et al. study the problem of placing m web proxies in the internet under a given traffic pattern. They consider the special case of a linear net topology with n nodes. Their goal is to minimize the overall latency of accessing the target web server subject to the network resources and traffic pattern. They show how this problem can be solved in O(n²m) time. In this short note, we observe that one of the underlying cost functions in this problem carries a Monge structure. By exploiting this structure and by applying some well-known results from the literature, we get a faster algorithm with time complexity O(nm).
Effective algorithms for the economic lot-sizing problem with bounded inventory and linear fixed-charge cost structure
2021, Mathematics
Contiguous graph partitioning for optimal total or bottleneck communication
2020, arXiv

View all citing articles on Scopus

View full text

Sequence comparison with mixed convex and concave costs

Abstract

Theoret. Comput. Sci.

Bull. Math. Biol.

Adv. in Appl. Math.

J. Algorithms

Geometric applications of a matrix-searching algorithm

Algorithmica

Searching in multidimensional monotone matrices

The Design and Analysis of Computer Algorithms