Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Hi-index | 0.00 |
We present new numerical characterization of DNA sequences that is based on the modified graphical representation proposed by Hamori. While Hamori embeds the sequence into Euclidean space, we use analogous embedding into the strong product of graphs, K4 ??? Pn, with weighted edges. Based on this representation, a novel numerical characterization was proposed in [Pesek and Žerovnik, MATCH Commun. Math. Comput. Chem. (Krag.), vol 60, 2008, 301-312] which is based on the products of ten eigenvalues from the start and the end of the descending ordered list of the eigenvalues of the L/L matrices associated with DNA. In this paper we compare two further numerical characterizations of the same type emphasizing the robustness of the approach.