## Tree Orbits under Permutation Group Action: Algorithm, Enumeration and Application to Viral Assembly (2009)

### BibTeX

@MISC{Bóna09treeorbits,

author = {Miklós Bóna and Meera Sitharam and Andrew Vince},

title = {Tree Orbits under Permutation Group Action: Algorithm, Enumeration and Application to Viral Assembly},

year = {2009}

}

### OpenURL

### Abstract

This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the assembly process is not. For the purpose of this paper, the capsid is modeled by a polyhedron whose facets represent the monomers. The assembly process is modeled by a rooted tree, the leaves representing the facets of the polyhedron, the root representing the assembled polyhedron, and the internal vertices representing intermediate stages of assembly (subsets of facets). Besides its virological motivation, the enumeration of orbits of trees under the action of a finite group is of independent mathematical interest. If G is a finite group acting on a finite set X, then there is a natural induced action of G on the set TX of trees whose leaves are bijectively labeled by the elements of X. If G acts simply on X, then |X |: = |Xn | = n · |G|, where n is the number of G-orbits in X. The basic combinatorial results in this paper are (1) a formula for the number of orbits of each size in the action of G on TXn, for every n, and (2) a simple algorithm to find the stabilizer of a tree τ ∈ TX in G that runs in linear time and does not need memory in addition to its input tree.

### Citations

323 |
A Course in Combinatorics
- Lint, Wilson
- 2001
(Show Context)
Citation Context ...n tX(H) = ∑ µ(H, K) tX(K), H≤K≤G where µ is the Möbius function for the lattice of subgroups of G. Proof: Clearly tX(H) = ∑ H≤K≤G tX(K). The theorem follows from the standard Möbius inversion formula =-=[22]-=- (page 333). The index of a subgroup H in G is the number of left (equivalently, right), cosets of H in G, and is denoted by (G : H). By Lagrange’s Theorem, this index equals |G|/|H|. 82 1 3 1 4 2 4 ... |

191 |
Enumerative combinatorics, volume 2
- Stanley
- 1986
(Show Context)
Citation Context ...m 16 The generating function fG(x) satisfies the following functional equations: 1 − x + 2f(x) = exp (f(x)), and for |G| > 1, 1 + 2fG(x) = exp ( ∑ H≤G ̂fH(x) ) . Proof: The first formula is proved in =-=[20]-=-, page 13. For |G| > 1, we use the standard exponential and the product formulas for generating functions. The proof of the second formula uses two well known results from the theory of exponential ge... |

85 |
Algorithms on Trees and Graphs
- Valiente
- 2002
(Show Context)
Citation Context ...n Theorem 9 of Section 4. Concerning Problem (ii), algorithms for permutation groups have been well-studied (see for example [17]), and algorithms for tree isomorphism and automorphism are well known =-=[8, 21]-=-. Moreover, the structure of the automorphism groups of rooted, labeled trees have been studied [11, 23]. However, we have not encountered an algorithm in the literature for deciding whether a given p... |

77 |
Physical principles in the construction of regular viruses
- Caspar, Klug
- 1962
(Show Context)
Citation Context ...icosahedral symmetry. Icosahedral viral shells can be classified based on their polyhedral structure, facets corresponding to the monomers. The classical “quasi-equivalence theory” of Caspar and Klug =-=[6]-=- explains the structure of the polyhedral shell in the case where the monomers have very similar neighborhoods. According to the theory, the number of facets in the polyhedron is 60T, where the T-numb... |

61 |
Optimal algorithms for comparing trees with labelled leaves
- Day
- 1985
(Show Context)
Citation Context ...n Theorem 9 of Section 4. Concerning Problem (ii), algorithms for permutation groups have been well-studied (see for example [17]), and algorithms for tree isomorphism and automorphism are well known =-=[8, 21]-=-. Moreover, the structure of the automorphism groups of rooted, labeled trees have been studied [11, 23]. However, we have not encountered an algorithm in the literature for deciding whether a given p... |

37 |
Permutation Group Algorithms
- Seress
- 2003
(Show Context)
Citation Context ...essary to characterize the set of such fixed assembly trees. This is done in Theorem 9 of Section 4. Concerning Problem (ii), algorithms for permutation groups have been well-studied (see for example =-=[17]-=-), and algorithms for tree isomorphism and automorphism are well known [8, 21]. Moreover, the structure of the automorphism groups of rooted, labeled trees have been studied [11, 23]. However, we have... |

35 |
Coloring rules for finite trees, and probabilities of monadic second order sentences. Random Structures and Algorithms
- Woods
- 1997
(Show Context)
Citation Context ...the use of extra scratch memory. If one is only interested in approximate and asymptotic estimates for Problem (i), such as in viruses with large T-numbers, a possible avenue is to use the results of =-=[7, 24]-=- that estimate the asymptotic probabilities of logic properties on finite structures, especially trees. There are significant roadblocks, however, to applying these results to our problem. These are m... |

32 |
Functional implications of the structure of the murine parvovirus, minute virus of mice
- Agbandje-McKenna, Llamas-Saiz, et al.
- 1998
(Show Context)
Citation Context ...of Mathematics, University of Florida, Gainesville, FL 32611. Email: avince@math.ufl.edu. 1, Figure 1: (Left) Basic Viral Structure. (Right) Minute virus of Mice X-ray and monomer structure courtesy =-=[1]-=- . 1 Introduction Viral shells, called capsids, encapsulate and protect the fragile nucleic acid genome from physical, chemical, and enzymatic damage. Francis Crick and James Watson (1956) were the fi... |

30 |
A logical approach to asymptotic combinatorics I: First-order properties
- Compton
- 1987
(Show Context)
Citation Context ...the use of extra scratch memory. If one is only interested in approximate and asymptotic estimates for Problem (i), such as in viruses with large T-numbers, a possible avenue is to use the results of =-=[7, 24]-=- that estimate the asymptotic probabilities of logic properties on finite structures, especially trees. There are significant roadblocks, however, to applying these results to our problem. These are m... |

24 |
Local rule-based theory of virus shell assembly
- Berger, Shor, et al.
- 1994
(Show Context)
Citation Context ...embly that we consider here. See Figure 1 for basic icosahedral structure and X-ray structure of a T=1 virus. Many mathematical models of viral shell assembly have been proposed and studied including =-=[2, 4, 12, 14, 15, 16, 25, 26, 27]-=-. Here we use the GT (geometry and tensegrity) model of [18]. In the GT model, information about the construction (or decomposition) of the viral shell is represented by an assembly tree. The vertices... |

19 |
To build a virus capsid. An equilibrium model of the self assembly of polyhedral protein complexes
- Zlotnick
- 1994
(Show Context)
Citation Context ...embly that we consider here. See Figure 1 for basic icosahedral structure and X-ray structure of a T=1 virus. Many mathematical models of viral shell assembly have been proposed and studied including =-=[2, 4, 12, 14, 15, 16, 25, 26, 27]-=-. Here we use the GT (geometry and tensegrity) model of [18]. In the GT model, information about the construction (or decomposition) of the viral shell is represented by an assembly tree. The vertices... |

15 | A constructive enumeration of fullerenes
- Brinkmann, Dress
- 1997
(Show Context)
Citation Context ...are mentioned in the open problem section at the end of this paper. Finally, there is a rich literature on the enumeration of construction sequences of symmetric polyhedra and their underlying graphs =-=[5, 9, 10]-=-. Whereas these studies focus on enumerating construction sequences of different polyhedra with a given number of facets, our goal - of counting and characterizing assembly tree orbits - is geared tow... |

12 |
A theoretical model successfully identifies features of hepatitis B virus capsid assembly. Biochemistry 38
- Zlotnick, Johnson, et al.
- 1999
(Show Context)
Citation Context ...embly that we consider here. See Figure 1 for basic icosahedral structure and X-ray structure of a T=1 virus. Many mathematical models of viral shell assembly have been proposed and studied including =-=[2, 4, 12, 14, 15, 16, 25, 26, 27]-=-. Here we use the GT (geometry and tensegrity) model of [18]. In the GT model, information about the construction (or decomposition) of the viral shell is represented by an assembly tree. The vertices... |

11 |
Quasi-equivalent viruses: A paradigm for protein assemblies
- Johnson, Speir
- 1997
(Show Context)
Citation Context |

10 |
Supramolecular self-assembly: Molecular dynamics modeling of polyhedral shell formation
- Rapaport, Johnson, et al.
- 1998
(Show Context)
Citation Context |

10 |
Mechanisms of capsid assembly for an icosahedral plant virus. Virology 277
- Zlotnick, Aldrich, et al.
- 2000
(Show Context)
Citation Context |

9 |
Energetic of quasiequivalence: computational analysis of protein-protein interactions in icosahedral viruses
- Reddy, Giesing, et al.
- 1998
(Show Context)
Citation Context |

7 | Local rules switching mechanism for viral shell geometry
- Berger, Shor
- 1995
(Show Context)
Citation Context |

7 |
Pattern formation in icosahedral virus capsids: The papova viruses and nudaurelia capensis β virus
- Marzec, Day
- 1993
(Show Context)
Citation Context |

4 | Zigzag structures of simple two-faced polyhedra
- Deza, Dutour
- 2005
(Show Context)
Citation Context ...are mentioned in the open problem section at the end of this paper. Finally, there is a rich literature on the enumeration of construction sequences of symmetric polyhedra and their underlying graphs =-=[5, 9, 10]-=-. Whereas these studies focus on enumerating construction sequences of different polyhedra with a given number of facets, our goal - of counting and characterizing assembly tree orbits - is geared tow... |

3 |
Conjugacy classes of the automorphism group of a tree
- Gawron, Nekrashevic, et al.
- 1999
(Show Context)
Citation Context ...died (see for example [17]), and algorithms for tree isomorphism and automorphism are well known [8, 21]. Moreover, the structure of the automorphism groups of rooted, labeled trees have been studied =-=[11, 23]-=-. However, we have not encountered an algorithm in the literature for deciding whether a given permutation group element fixes a given rooted, labeled tree; and thereby finds the stabilizer of that tr... |

2 |
Modeling virus assembly using geometric constraints and tensegrity:avoiding dynamics
- Sitharam, Agbandje-McKenna
(Show Context)
Citation Context ...ure of a T=1 virus. Many mathematical models of viral shell assembly have been proposed and studied including [2, 4, 12, 14, 15, 16, 25, 26, 27]. Here we use the GT (geometry and tensegrity) model of =-=[18]-=-. In the GT model, information about the construction (or decomposition) of the viral shell is represented by an assembly tree. The vertices of the tree represent 220 10 11 5 12 13 9 4 3 2 1 14 17 8 ... |

2 | Combinatorial enumeration of macromolecular assembly pathways - Sitharam, Bóna - 2004 |

2 |
On an identity for the cycle indices of rooted tree automorphism groups. Electron
- Wagner
(Show Context)
Citation Context ...died (see for example [17]), and algorithms for tree isomorphism and automorphism are well known [8, 21]. Moreover, the structure of the automorphism groups of rooted, labeled trees have been studied =-=[11, 23]-=-. However, we have not encountered an algorithm in the literature for deciding whether a given permutation group element fixes a given rooted, labeled tree; and thereby finds the stabilizer of that tr... |

1 |
Sitharam Influence of symmetry on probabilities of icosahedral viral assembly pathways
- Bóna, M
- 2008
(Show Context)
Citation Context ...io of the probabilities of the corresponding assembly pathways - provided that the former ratio is not cancelled out or reversed by the ratio of the geometric stability factor of τ1 and τ2. The paper =-=[3]-=- formally proved that this kind of cancelling out would not generally take place, at least for valid pathways, for the following reasons. First, it is shown in [3] that the symmetry factor of a pathwa... |

1 |
Zigzags, railroads, and knots in fullerenes, Chem
- Deza, Dutour, et al.
(Show Context)
Citation Context ...are mentioned in the open problem section at the end of this paper. Finally, there is a rich literature on the enumeration of construction sequences of symmetric polyhedra and their underlying graphs =-=[5, 9, 10]-=-. Whereas these studies focus on enumerating construction sequences of different polyhedra with a given number of facets, our goal - of counting and characterizing assembly tree orbits - is geared tow... |