Related content

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

By Myoupo J-F.   Semé D.  

Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. : 212-223

Academic Press

Access to resources Recommend Favorite

On the approximation of longest common nonsupersequences and shortest common nonsubsequences

By Zhang L.  

Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. : 353-362

Elsevier

Access to resources Recommend Favorite

New Processor Array Architectures for the Longest Common Subsequence Problem

By Michailidis Panagiotis   Margaritis Konstantinos  

The Journal of Supercomputing, Vol. 32, Iss. 1, 2005-04 ,pp. : 51-69

Springer Publishing Company

Access to resources Recommend Favorite

The longest common subsequence problem for sequences with nested arc annotations

By Lin G.   Chen Z-Z.   Jiang T.   Wen J.  

Journal of Computer and System Sciences, Vol. 65, Iss. 3, 2002-11 ,pp. : 465-480

Academic Press

Access to resources Recommend Favorite

On the asymptotic average length of a maximum common subsequence for words over a finite alphabet

By Tomescu I.  

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 277-285

Elsevier

Access to resources Recommend Favorite