Next:
SHORTEST COMMON SUPERSEQUENCE
Up:
Storage and Retrieval
Previous:
MINIMUM DYNAMIC STORAGE ALLOCATION
Index
Compression and Representation
S
HORTEST
C
OMMON
S
UPERSEQUENCE
S
HORTEST
C
OMMON
S
UPERSTRING
L
ONGEST
C
OMMON
S
UBSEQUENCE
M
AXIMUM
C
OMMON
S
UBTREE
M
AXIMUM
C
OMMON
P
OINT
S
ET
M
INIMUM
R
ECTANGLE
C
OVER
Viggo Kann
2000-03-20
