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

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

Publisher： Springer Publishing Company

ISSN： 1387-5841

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

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

Matching for Run-Length Encoded Strings

By Apostolico A.   Landau G.M.   Skiena S.  

Journal of Complexity, Vol. 15, Iss. 1, 1999-03 ,pp. : 4-16

Academic Press

Access to resources Recommend Favorite

Relative Length of Longest Paths and Cycles in Graphs

By Liu Huiqing   Lu Mei   Tian Feng  

Graphs and Combinatorics, Vol. 23, Iss. 4, 2007-08 ,pp. : 433-443

Springer Publishing Company

Access to resources Recommend Favorite