The matrix iteration algorithm solving an enumeration problem on bacterial complete genomes

MaRDI QIDQ2574310zbMATH OpenFDO

Authors Huakang Yang, Chengxiang Huang, Xiao-Wei Wen

Publication date 21 November 2005

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

zbMATH Keywords

alphabet \(\Sigma\)minimal set \(B\) of forbidden words

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• A linear time algorithm for the inversion median problem in circular bacterial genomes
• The contig assembly problem and its algorithmic solutions
• Combinatorics from Bacterial Genomes
• De Bruijn enumeration applied to some genetical problems
• Linearizing genomes: exact methods and local search
• scientific article; zbMATH DE number 2073943
• An integer programming approach to DNA sequence assembly
• A faster algorithm for genomic sorting problem
• scientific article; zbMATH DE number 7651113

Cited in

(3)

• Structure of the space of taboo-free sequences
• Combinatorics from Bacterial Genomes
• Avoided strings in bacterial complete genomes and a related combinatorial problem

This page was built for publication: The matrix iteration algorithm solving an enumeration problem on bacterial complete genomes

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