On correlation polynomials and subword complexity

MaRDI QIDQ3576750zbMATH OpenFDO

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

zbMATH Keywords

analytic methodsasymptoticsautocorrelationaverage-case analysiscombinatorics on wordscorrelation polynomialde Bruijn graphdepthsubword complexitysuffix trees

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Sublinear algorithms for approximating string compressibility
• Coding sequence density estimation via topological pressure
• Subword complexity and periodicity in two or more dimensions
• Subword complexity and Laurent series
• scientific article; zbMATH DE number 5990082 (Why is no real title available?)
• The Complexity of Problems in P Given Correlated Instances
• Maximal number of subword occurrences in a word

Describes a project that uses

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)