Related Experiment Video
Updated: Aug 20, 2026

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma
Published on: December 28, 2015
A (sub)graph isomorphism algorithm for matching large graphs
Luigi P Cordella1, Pasquale Foggia, Carlo Sansone
1Dipartimento di Informatica e Sistemistica, Universitá di Napoli Federico II Via Claudio 21, I-80125 Napoli, Italy. cordel@unina.it
Abstract:
We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of the algorithm has been presented in a previous paper, where we examined its performance for the isomorphism of small and medium size graphs. The algorithm is improved here to reduce its spatial complexity and to achieve a better performance on large graphs; its features are analyzed in detail with special reference to time and memory requirements. The results of a testing performed on a publicly available database of synthetically generated graphs and on graphs relative to a real application dealing with technical drawings are presented, confirming the effectiveness of the approach, especially when working with large graphs.
Related Concept Videos
Graphical Representation of Inequalities
Graphs of Two-Variable Functions
Graphs of Functions
Graphs of Equations in Two Variables
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Wilcoxon Signed-Ranks Test for Matched Pairs