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

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

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

RNA multiple structural alignment with longest common subsequences

By Bereg Sergey   Kubica Marcin   Waleń Tomasz   Zhu Binhai  

Journal of Combinatorial Optimization, Vol. 13, Iss. 2, 2007-02 ,pp. : 179-188

Springer Publishing Company

Access to resources Recommend Favorite