Top 0.1 percent best scoring trees for the NPC maturation order
Supplementary analyzed data from Manuscript: TITLE: Maturation kinetics of a multiprotein complex revealed by metabolic labeling. JOURNAL: CELL. Article Type: Research Article Authors: Evgeny Onischenko*, Elad Noor*, Jonas S. Fischer*, Ludovic Gillet, Matthias Wojtynek, Pascal Vallotton, Karsten Weis *Equally Contributing Authors Corresponding Authors: Evgeny Onischenko and Karsten Weis Related to Figures 5 and S5. Possible maturation orders in NPC biogenesis, are represented by a binary tree whose leaves are the 9 identified NUP assembly groups. The leafs are allowed to gradually merge representing the co-assembly events among NUPs until they form a complete NPC (tree root). Each leaf and each vertex (i.e. a mature complex of several such leaves) in the tree is assigned a single variable which represents its relative pool size. For every possible tree configuration this set of variables is optimised to match the effective maturation pool data from the KSM fitting. RMSE (Root Mean Squared Error) between the computed maturation pools from the binary tree and the ones estimated by KSM is used as the tree score. The graphs represent 0.1% best scoring trees (i.e. with the lowest RMSE values) arranged in an ascending order.