Efficient algorithms for finding a longest common increasing subsequence

By Chan Wun-Tat   Zhang Yong   Fung Stanley   Ye Deshi   Zhu Hong  

Journal of Combinatorial Optimization, Vol. 13, Iss. 3, 2007-04 ,pp. : 277-288

Springer Publishing Company

Access to resources Recommend Favorite

An Iterative Approach to Determining the Length of the Longest Common Subsequence of Two Strings

By Booth Hilary S.   MacNamara Shevarl F.   Nielsen Ole M.   Wilson Susan R.  

Methodology And Computing In Applied Probability, Vol. 6, Iss. 4, 2004-12 ,pp. : 401-421

Springer Publishing Company

Access to resources Recommend Favorite

Sparse Dynamic Programming for Longest Common Subsequence from Fragments

By Baker B.S.   Giancarlo R.  

Journal of Algorithms, Vol. 42, Iss. 2, 2002-02 ,pp. : 231-254

Academic Press

Access to resources Recommend Favorite

Generalized monotone line search SQP algorithm for constrained minimax problems

By Jian Jin-Bao  

Optimization, Vol. 58, Iss. 1, 2009-01 ,pp. : 101-131

Taylor & Francis Ltd

Access to resources Recommend Favorite

GSOR Method for the Equality Constrained Least Squares Problems and the Generalized Least Squares Problems

By Evans David J.  

International Journal of Computer Mathematics, Vol. 79, Iss. 8, 2002-01 ,pp. : 955-960

Taylor & Francis Ltd

Access to resources Recommend Favorite