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

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

Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequences

By Ning Kang   Ng Hoong Kee   Leong Hon Wai  

International Journal of Data Mining and Bioinformatics, Vol. 5, Iss. 6, 2011-02 ,pp. : 611-625

Inderscience Publishers

Access to resources Recommend Favorite