On finding minimal, maximal, and consistent sequences over a binary alphabet

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.145, Iss.1, 1995-07, pp. : 317-327

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

Finding the Minimal Set of Maximum Disks for Binary Objects

By Nilsson F. Danielsson P.E.

Graphical Models and Image Processing, Vol. 59, Iss. 1, 1997-01 ,pp. : 55-60

Academic Press

Access to resources Recommend Favorite

Maximal exceptions with minimal descriptions

By Leeuwen Matthijs

Data Mining and Knowledge Discovery, Vol. 21, Iss. 2, 2010-09 ,pp. : 259-276

Springer Publishing Company

Access to resources Recommend Favorite

Maximal and Minimal Solutions to Language Equations

By Kari L. Thierrin G.

Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. : 487-496

Academic Press

Access to resources Recommend Favorite

Code bounds for multiple packings over a nonbinary finite alphabet

By Blinovsky V.

Problems of Information Transmission, Vol. 41, Iss. 1, 2005-01 ,pp. : 23-32

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the asymptotic average length of a maximum common subsequence for words over a finite alphabet

By Tomescu I.

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 277-285

Elsevier

Access to resources Recommend Favorite