Matching for Run-Length Encoded Strings

Author： Apostolico A.   Landau G.M.   Skiena S.  

Publisher： Academic Press

ISSN： 0885-064X

Source： Journal of Complexity, Vol.15, Iss.1, 1999-03, pp. : 4-16

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

Egoroff’s theorem and maximal run length

By Ma Ji-Hua   Wen Sheng-You   Wen Zhi-Ying  

Monatshefte für Mathematik, Vol. 151, Iss. 4, 2007-08 ,pp. : 287-292

Springer Publishing Company

Access to resources Recommend Favorite

An Iterative Approach to Determining the Length of the Longest Common Subsequence of Two Strings

By Booth Hilary S.   MacNamara Shevarl F.   Nielsen Ole M.   Wilson Susan R.  

Methodology And Computing In Applied Probability, Vol. 6, Iss. 4, 2004-12 ,pp. : 401-421

Springer Publishing Company

Access to resources Recommend Favorite

Pass or Run: An Empirical Test of the Matching Pennies Game Using Data from the National Football League

By  

SOUTHERN ECONOMIC JOURNAL, Vol. 76, Iss. 3, 2010-01 ,pp. : 791-810

John Wiley & Sons Inc

Access to resources Recommend Favorite

Eigenvalue ratios of vibrating strings

By Kiss Márton  

Acta Mathematica Hungarica, Vol. 110, Iss. 3, 2006-02 ,pp. : 253-259

Springer Publishing Company

Access to resources Recommend Favorite

Strings and stripes in ionic solids

By Kusmartsev F.V.  

Physica E, Vol. 18, Iss. 1, 2003-05 ,pp. : 352-353

Elsevier

Access to resources Recommend Favorite