A new bound on the length of the shortest string containing all r-permutations.
Mao-cheng CaiPublished in: Discret. Math. (1982)
Keyphrases
- finite alphabet
- alphabet size
- upper bound
- arbitrary length
- path length
- edit distance
- longest common subsequence
- fixed length
- regular expressions
- error bounds
- lower bound
- shortest path
- maximum number
- variable length
- probability distribution
- string matching
- pattern matching
- information systems
- edit operations
- minimal length
- neural network
- data sets
- worst case
- biological sequences
- approximate string matching
- artificial intelligence
- genetic algorithm