Two-pattern strings. II: Frequency of occurrence and substring complexity
type: Item
instance of: scholarly article
title: Two-pattern strings. II: Frequency of occurrence and substring complexity
zbMATH Open document ID: 1156.68044
author: Frantisek Franek
author: Jiandong Jiang
author: W. F. Smyth
published in: Journal of Discrete Algorithms
publication date: 2008-05-29T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5280795
zbMATH Keywords: string
zbMATH Keywords: two-pattern
zbMATH Keywords: Sturmian
zbMATH Keywords: complexity
zbMATH Keywords: frequency
zbMATH Keywords: periodicity
MaRDI profile type: Publication
full work available at URL: j.jda.2006.04.002
OpenAlex ID: W2015957628
cites work: Repetitions in Sturmian strings
cites work: Two-pattern strings. I: A recognition algorithm
cites work: SORTING SUFFIXES OF TWO-PATTERN STRINGS
cites work: Periods in strings
cites work: Q4529547
DOI: 10.1016/J.JDA.2006.04.002
description: scientific article; zbMATH DE number 5280795