For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
With the explosive growth of proteomic and expression data of homologous genes, it becomes necessary to explore new methods to visualize and analyze related gene expression data t...
Li Jin, Karl V. Steiner, Carl J. Schmidt, Keith...
Abstract— This paper presents an approach to create topological maps from geometric maps obtained with a mobile robot in an indoor-environment using range data. Our approach util...
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
— The growing Recurrent Self-Organizing Map (GRSOM) is embedded into a standard Self-Organizing Map (SOM) hierarchy. To do so, the KDD benchmark dataset from the International Kn...
Ozge Yeloglu, A. Nur Zincir-Heywood, Malcolm I. He...