Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequences

Author： Ning Kang   Ng Hoong Kee   Leong Hon Wai  

Publisher： Inderscience Publishers

ISSN： 1748-5673

Source： International Journal of Data Mining and Bioinformatics, Vol.5, Iss.6, 2011-02, pp. : 611-625

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

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

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

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

Consistent subsequences and supersequences

By Fraser C.  

Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. : 233-246

Elsevier

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