Finding longest increasing and common subsequences in streaming data

By Liben-Nowell David   Vee Erik   Zhu An  

Journal of Combinatorial Optimization, Vol. 11, Iss. 2, 2006-03 ,pp. : 155-175

Springer Publishing Company

Access to resources Recommend Favorite

On the generalized constrained longest common subsequence problems

By Chen Yi-Ching  

Journal of Combinatorial Optimization, Vol. 21, Iss. 3, 2011-04 ,pp. : 383-392

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

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees

By Alstrup S.   Thorup M.  

Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. : 169-188

Academic Press

Access to resources Recommend Favorite