Network clustering coefficient approach to DNA sequence analysis

DOI10.1016/J.CHAOS.2005.08.138MaRDI QIDQ2497618zbMATH OpenOpenAlexFDO

Authors Günther J. L. Gerhardt, Ney Lemke, G. Corso

Publication date 4 August 2006

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.chaos.2005.08.138

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40)

Recommendations

• A new graph theoretical method for analyzing DNA sequences based on genetic codes
• Publication:4888918
• Analysis of similarity/dissimilarity of DNA sequences based on dual nucleotides
• Analysis of similarity/dissimilarity of DNA sequences by a new 3D graphical representation
• A novel method for sequence similarity analysis based on the relative frequency of dual nucleo\-tides

Cites work

• Statistical mechanics of complex networks
• Stochastic Process with Ultraslow Convergence to a Gaussian: The Truncated Lévy Flight
• The fractal structure of the mitochondrial genomes

This page was built for publication: Network clustering coefficient approach to DNA sequence analysis

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