Strings with maximally many distinct subsequences and substrings.

Flaxman, Abraham, Harrow, Aram W., and Sorkin, Gregory B.. "Strings with maximally many distinct subsequences and substrings.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper R8, 10 p.-Research paper R8, 10 p.. <http://eudml.org/doc/123417>.

@article{Flaxman2004,
author = {Flaxman, Abraham, Harrow, Aram W., Sorkin, Gregory B.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {extremal combinatorics},
language = {eng},
number = {1},
pages = {Research paper R8, 10 p.-Research paper R8, 10 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Strings with maximally many distinct subsequences and substrings.},
url = {http://eudml.org/doc/123417},
volume = {11},
year = {2004},
}

TY - JOUR
AU - Flaxman, Abraham
AU - Harrow, Aram W.
AU - Sorkin, Gregory B.
TI - Strings with maximally many distinct subsequences and substrings.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper R8, 10 p.
EP - Research paper R8, 10 p.
LA - eng
KW - extremal combinatorics
UR - http://eudml.org/doc/123417
ER -