Abstract
By visualizing bacterial genome data we have encountered a few neat mathematical problems. The first problem concerns the number of longer missing strings (of length K + i, i ≥ 1) taken away by the absence of one or more K-strings. The exact solution of the problem may be obtained by using the Golden-Jackson cluster method in combinatorics and by making use of a special kind of formal languages, namely, the factorizable language. The second problem consists in explaining the fine structure observed in one-dimensional K-string histograms of some randomized genomes. The third problem is the uniqueness of reconstructing a protein sequence from its constituent K-peptides. The latter problem has a natural connection with the number of Eulerian loops in a graph. To tell whether a protein sequence has a unique reconstruction at a given K the factorizable language again comes to our help.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hao, B., Xie, H., Yu, Z., Chen, G.: A combinatorial problem related to avoided strings in bacterial complete genomes. Ann. Combin. 4, 247–255 (2000)
Xie, H., Hao, B.: Visualization of K-tuple distribution in prokaryote complete genomes and their randomized counterparts. In: Bioinformatics. CSB 2002 Proceedings, pp. 31–42. IEEE Computer Society, Los Alamitos, California (2002)
Shen, J., Zhang, S., Lee, H.-C., Hao, B.: SeeDNA: a visualization tool for K-string content of long DNA sequences and their randomized counterparts. Genomics, Proteomics and Bioinformatics 2, 192–196 (2004)
Shi, X., Xie, H., Zhang, S., Hao, B.: Decomposition and reconstruction of protein sequences: the problem of uniqueness and factorizable language. J. Korean Phys. Soc. 50, 118–123 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hao, B. (2007). Combinatorics from Bacterial Genomes. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)