Skip to main content
SpringerLink
Log in

Avoided Strings in Bacterial Complete Genomes and a Related Combinatorial Problem

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Theoretical Physics, Academia Sinica, P.O. Box 2735, Beijing 100080, China, e-mail: hao@itp.ac.cn, , , , , , CN

    Bailin Hao, Huimin Xie, Zuguo Yu & Guoyi Chen

Authors
  1. Bailin Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huimin Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zuguo Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guoyi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received December 12, 1998

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00001279

Search

Navigation