Avoided strings in bacterial complete genomes and a related combinatorial problem

DOI10.1007/PL00001279zbMath0970.05007OpenAlexW2062022624MaRDI QIDQ5930076

Guoyi Chen, Bai-Lin Hao, Huimin Xie, Zu-Guo Yu

Publication date: 17 April 2001

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001279

zbMATH Keywords

enumerationavoided stringscomplete genomeslanguage

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Biochemistry, molecular biology (92C40)

Related Items (7)

Chaos game representation of protein sequences based on the detailed HP model and their multifractal and correlation analyses ⋮ SUBSHIFTS OF FINITE TYPE WITH A HOLE ⋮ ON THE VISUALIZATION OF STRINGS AND FRACTALS OF SOME FORBIDDEN WORDS ⋮ Distance, correlation and mutual information among portraits of organisms based on complete genomes ⋮ Generalizations of the Goulden–Jackson cluster method ⋮ Information capacity of nucleotide sequences and its applications ⋮ A time series model of CDS sequences in complete genome

This page was built for publication: Avoided strings in bacterial complete genomes and a related combinatorial problem