Discrete Mathematics & Theoretical Computer Science · 2003 · 41 citations · 15 references
Natural SciencesComputer ScienceMathematicsCombinatoricsGenerating FunctionsPattern GenerationEnumeration Of Combinatorial ClassesSubword Representation
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
15
The Art of Computer Programming
G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations
Rodica Simion, Frank Schmidt · European Journal of Combinatorics · 1985 · 348 citations
Anders Claesson · European Journal of Combinatorics · 2001 · 150 citations