An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains

In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and a set of $d$ constrains $P=\{P_1,...,P_d\}$ of total length $r$, the problem is to find a common subsequence $Z$ of $X$ and $Y$ excluding each of constrain string in $P$ as a substring and the length of $Z$ is maximized. The problem was declared to be NP-hard\cite{1}, but we finally found that this is not true. A new dynamic programming solution for this problem is presented in this paper. The correctness of the new algorithm is proved. The time complexity of our algorithm is $O(nmr)$.Comment: arXiv admin note: substantial text overlap with arXiv:1301.718

Optimal trajectory generation in ocean flows

In this paper it is shown that Lagrangian Coherent Structures (LCS) are useful in determining near optimal trajectories for autonomous underwater gliders in a dynamic ocean environment. This opens the opportunity for optimal path planning of autonomous underwater vehicles by studying the global flow geometry via dynamical systems methods. Optimal glider paths were computed for a 2-dimensional kinematic model of an end-point glider problem. Numerical solutions to the optimal control problem were obtained using Nonlinear Trajectory Generation (NTG) software. The resulting solution is compared to corresponding results on LCS obtained using the Direct Lyapunov Exponent method. The velocity data used for these computations was obtained from measurements taken in August, 2000, by HF-Radar stations located around Monterey Bay, CA