Computing the longest common substring with one mismatch

ISSN： 0032-9460

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

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

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

Application of Mismatch Detection Methods in DNA Computing

By Henkel Christiaan Rozenberg Grzegorz Spaink Herman

Natural Computing, Vol. 5, Iss. 2, 2006-05 ,pp. : 151-163

Springer Publishing Company

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