Two-pattern strings. II: Frequency of occurrence and substring complexity (Q925072): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2006.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015957628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in Sturmian strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-pattern strings. I: A recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: SORTING SUFFIXES OF TWO-PATTERN STRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periods in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:06, 28 June 2024

scientific article
Language Label Description Also known as
English
Two-pattern strings. II: Frequency of occurrence and substring complexity
scientific article

    Statements

    Two-pattern strings. II: Frequency of occurrence and substring complexity (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2008
    0 references
    0 references
    string
    0 references
    two-pattern
    0 references
    Sturmian
    0 references
    complexity
    0 references
    frequency
    0 references
    periodicity
    0 references
    0 references