Before revision:  We introduce several algorithmic novelties to achieve this . Namely, these existing NA methods compute homogeneous graphlet-based node similarities and then find high-scoring alignments with respect to these similarities, while simultaneously maximizing the number of conserved edges.
After revision:  We introduce several algorithmic novelties to achieve this . Namely, these existing NA methods compute homogeneous graphlet-based node similarities and then find high-scoring alignments with respect to these similarities, while simultaneously maximizing the amount of conserved edges.