Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

ISSN： 0178-4617

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

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

Related content

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

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

Quick value-setting algorithms for the longest path problem of job-shop scheduling

By Hong Choi Shiu Yu Yang Feng

Journal of Manufacturing Technology Management, Vol. 16, Iss. 8, 2005-01 ,pp. : 956-972

Emerald Group Publishing Ltd

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