On correlation polynomials and subword complexity

zbMATH Open1192.68961MaRDI QIDQ3576750FDOQ3576750

Authors: Irina Gheorghiciuc, Mark Daniel Ward 

Publication date: 2 August 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0101/0.html

Recommendations

• scientific article; zbMATH DE number 3892611
• scientific article; zbMATH DE number 4085051
• scientific article; zbMATH DE number 1091206
• scientific article; zbMATH DE number 1992419
• Correlations of Partial Words

zbMATH Keywords

asymptoticsautocorrelationcombinatorics on wordsaverage-case analysisdepthsuffix treesde Bruijn graphanalytic methodssubword complexitycorrelation polynomial

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer aspects of numerical algorithms (65Y99) Combinatorics on words (68R15)

Cited In (6)

• The Complexity of Problems in P Given Correlated Instances
• Sublinear algorithms for approximating string compressibility
• Coding sequence density estimation via topological pressure
• Subword complexity and Laurent series
• Subword complexity and periodicity in two or more dimensions
• Title not available (Why is that?)

Uses Software

• Regexpcount

This page was built for publication: On correlation polynomials and subword complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576750)