We present a general method for calculating the genus distributions of those infinite families of graphs that are obtained by iteratively amalgamating copies of some base graphs along their root-edges. We presume that the partitioned genus distributions of these base graphs are known and that their root-edges have 2-valent endpoints. We analyze and adapt the use of recombinant strands, partials, and productions for deriving simultaneous recurrences for genus distributions.