On the Common Substring Alignment Problem

Publisher： Elsevier

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.41, Iss.2, 2001-11, pp. : 338-359

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

RNA multiple structural alignment with longest common subsequences

By Bereg Sergey Kubica Marcin Waleń Tomasz Zhu Binhai

Journal of Combinatorial Optimization, Vol. 13, Iss. 2, 2007-02 ,pp. : 179-188

Springer Publishing Company

Access to resources Recommend Favorite

On problem of nearest common fixed point of nonexpansive mappings

By Zhang Shi-sheng

Applied Mathematics and Mechanics, Vol. 27, Iss. 7, 2006-07 ,pp. : 883-889

Springer Publishing Company

Access to resources Recommend Favorite

Convergence of a Cyclic Algorithm for the Split Common Fixed Point Problem Without Continuity Assumption

Mathematical Modelling and Analysis, Vol. 18, Iss. 4, 2013-09 ,pp. : 537-542

Taylor & Francis Ltd

Access to resources Recommend Favorite

Vertical alignment of liquid crystals without alignment layers

By Kim Ki-Han

Liquid Crystals, Vol. 40, Iss. 3, 2013-03 ,pp. : 391-395

Taylor & Francis Ltd

Access to resources Recommend Favorite

Breaking alignment measurement barriers

World Pumps, Vol. 1997, Iss. 370, 1997-07 ,pp. : 14-14

Elsevier

Access to resources Recommend Favorite