New Processor Array Architectures for the Longest Common Subsequence Problem

Author： Michailidis Panagiotis   Margaritis Konstantinos  

Publisher： Springer Publishing Company

ISSN： 0920-8542

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

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

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

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 parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

By Pietrzak K.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 757-771

Elsevier

Access to resources Recommend Favorite

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

By Arnold Michael   Ohlebusch Enno  

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 806-818

Springer Publishing Company

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