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

Code bounds for multiple packings over a nonbinary finite alphabet

By Blinovsky V.  

Problems of Information Transmission, Vol. 41, Iss. 1, 2005-01 ,pp. : 23-32

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Determinization of transducers over finite and infinite words

By Beal M.-P.   Carton O.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 225-251

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

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