Abstract.
The visualization of avoided and under-represented strings in some bacterial complete genomes raises a combinatorial problem which may be solved either by using the Goulden-Jackson cluster method or by construction of the minimal finite automaton defined by the set of forbidden words of the corresponding language.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 12, 1998
Rights and permissions
About this article
Cite this article
Hao, B., Xie, H., Yu, Z. et al. Avoided Strings in Bacterial Complete Genomes and a Related Combinatorial Problem. Annals of Combinatorics 4, 247–255 (2000). https://doi.org/10.1007/PL00001279
Issue Date:
DOI: https://doi.org/10.1007/PL00001279