Abstract
In order to read a DNA sequence, we propose a method which induces the concept of DNA graph. In this paper, by discussing the adjoints of DNA graphs, we obtain more DNA graphs from known DNA graphs.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J.D. Watson F.H.C. Crick (1953) Nature 173 737–738
Yu.p. Lysov et al. (1998) Dokl. Acad. Sci. USSR 303 1508–1511
P.A. Pevzner (1989) J. Biomol. Struct. Dyn. 7 63–73
J. Blazewicz A. Hertz D. Kobler D. Werra Particlede (1999) Discrete Appl. Math. 98 1–19
M.S. Waterman, Applications of Combinatorics to Molecular Biology, in: Handbook of Combinatorics, ed. R. Graham et al. (Elsevier Science, B. V., 1995).
C. Berge, Graphes (Paris, Dunod, 1970).
J.A. Bondy U.S.R. Murty (1976) Graph Theory with Applications Macmillan Press Ltd. London
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS Subject classification: 92D20
The Project Supported by Zhejiang Provincial Natural Science Foundation of China (102055) and The Foundation of Zhejiang Universities’ Youth Teachers.
Rights and permissions
About this article
Cite this article
Hao, J. The adjoints of DNA graphs. J Math Chem 37, 333–346 (2005). https://doi.org/10.1007/s10910-004-1099-7
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10910-004-1099-7