Bibliographic Details
| Title: |
Counting occurrences of some subword patterns. |
| Authors: |
Burstein, Alexander1 burstein@math.iastate.edu, Mansour, Toufik2 toufik@labri.fr |
| Source: |
Discrete Mathematics & Theoretical Computer Science (DMTCS). Dec2003, Vol. 6 Issue 2, p1-11. 11p. |
| Subjects: |
Computational mathematics, Mathematical functions, Isomorphism (Mathematics), Combinatorics, Mathematical analysis |
| Abstract: |
We find generating functions for 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
