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

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

Computing the longest common substring with one mismatch

By Babenko M.   Starikovskaya T.  

Problems of Information Transmission, Vol. 47, Iss. 1, 2011-03 ,pp. : 28-33

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Shortest common superstrings and scheduling with coordinated starting times

By Middendorf M.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 205-214

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