Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Two-pattern strings. II: Frequency of occurrence and substring complexity

From MaRDI portal
Publication:925072
Jump to:navigation, search

DOI10.1016/J.JDA.2006.04.002zbMath1156.68044OpenAlexW2015957628MaRDI QIDQ925072

W. F. Smyth, Frantisek Franek, Jiandong Jiang

Publication date: 29 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.04.002


zbMATH Keywords

complexityfrequencyperiodicitystringSturmiantwo-pattern


Mathematics Subject Classification ID

Combinatorics on words (68R15)





Cites Work

  • Unnamed Item
  • Periods in strings
  • Repetitions in Sturmian strings
  • Two-pattern strings. I: A recognition algorithm
  • SORTING SUFFIXES OF TWO-PATTERN STRINGS




This page was built for publication: Two-pattern strings. II: Frequency of occurrence and substring complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:925072&oldid=12893124"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki