1. + Protein and gene model inference based on statistical modeling in k-partite graphs Sarah Gester, Ermir Qeli, Christian H. Ahrens, and Peter Buhlmann

2. + Problem Description Given peptides and scores/probabilities, infer the set of proteins present in the sample. PERFGKLMQK MLLTDFSSAWCR FFRDESQINNR TGYIPPPLJMGKR Protein A Protein B Protein C

3. + Previous Approaches N-peptides rule ProteinProphet (Nesvizhskii et al. 2003. Anal Chem) Assumes peptide scores are correct. Nested mixture model (Li et al. 2010. Ann Appl Statist) Rescores peptides while doing the protein inference Does not allow shared peptides Peptide scores are independent Hierarchical statistical model (Shen et al. 2008. Bioinformatics) Allows for shared peptides Assume PSM scores for the same peptide are independent Impractical on normal datasets MSBayesPro (Li et al. 2009. J Comput Biol) Uses peptide detectabilities to determine peptide priors.

4. + Markovian Inference of Proteins and Gene Models (MIPGEM) Inclusion of shared/degenerate peptides in the model. Treats peptide scores/probabilities as random values Model allows dependence of peptide scores. Inference of gene models

5. + Why scores as random values? PERFGKLMQK MLLTDFSSAWCR FFRDESQINNR TGYIPPPLJMGKR Protein A Protein B Protein C

6. + Building the bipartite graph

7. + Shared peptides

8. + Definitions Let p i be the score/probabilitiy of peptide i. I is the set of all peptides. Let Z j be the indicator variable for protein j. J is the set of all proteins.

9. + Simple Probability Rules

10. + Bayes Rule Prior probability on the protein being present Joint probability of seeing these peptide scores Probability of observing these peptide scores given that the protein is present

11. + Assumptions Prior probabilities of proteins are independent Dependencies can be included with a little more effort. This does not mean that proteins are independent.

12. + Assumptions Connected components are independent

13. + Assumptions Peptide scores are independent given their neighboring proteins. Ne(i) is the set of proteins connected to peptide i in the graph. I r is the set of peptides belonging to the rth connected component R(I r ) is the set of proteins connected to peptides in I r

14. + Assumptions Conditional peptide probabilities are modeled by a mixture model. The specific mixture model they use is based on the peptide scores used (from PeptideProphet).

15. + Bayes Rule Prior probability on the protein being present Joint probability of seeing these peptide scores Probability of observing these peptide scores given that the protein is present

16. + Joint peptide score distribution Assumption: peptides in different components are independent I r is the set of peptides in component r R(I r ) is the set of proteins connected to peptides in I r

17. + Conditional Probability Mixture model

18. + Conditional Probability Mixture model

19. + f 1 (x) – pdf of P(p i |{z j }) median

20. + Choosing b 1 and b 2 Seek to maximize the log likelihood of observing the peptide scores.

21. + Choosing b 1 and b 2 It turns out:

22. + Conditional Protein Probabilities

23. +

24. + Conditional Protein Probabilities(NEC Correction)

25. + Conditional Protein Probabilities

26. +

27. +

28. + Shared Peptides

29. +

30. + If the shared peptide has p i ≥ median

31. + Shared Peptides If the shared peptide has p i < median

32. + Gene Model Inference

33. + Assume a gene model, X, has only protein sequences which belong to the same connected component. Peptide 1 Peptide 2 Peptide 3 Peptide 4 Protein A Protein B Gene X

34. + Gene Model Inference Assume a gene model, X, has only protein sequences which belong to the same connected component. R(X) is the set of proteins with edges to X. I r(X) is the set of peptides with edges to proteins with edges to X

35. + Gene Model Inference Gene model, X, has proteins from different connected components of the peptide-protein graph. Peptide 1 Peptide 2 Peptide 3 Peptide 4 Protein A Protein B Gene X

36. + Gene Model Inference Gene model, X, has proteins from different connected components of the peptide-protein graph. R l (X) is the set of proteins with edges to X in component l. I l(X) is the set of peptides with edges to proteins with edges to X in component l.

37. + Datasets Mixture of 18 purified proteins Mixture of 49 proteins (Sigma49) Drosophila melanogaster Saccharomyces cerevisiae (~4200 proteins) Arabidopis thaliana (~4580 gene models)

38. + Comparisons with other tools Small datasets with a known answer Mix of 18 proteins Sigma49

39. + Comparisons with other tools One hit wonders Sigma49 no one hit wonders

40. + Comparison with other tools Arabidopsis thaliana dataset has many proteins with high sequence similarity.

41. + Splice isoforms

42. + Conclusion +Criticism Developed a model for protein and gene model inference. Comparisons with other tools do not justify complexity: Value of a small FP rate at the expense of many FN is not shared for all applications. Discard some useful information such as #spectra/peptide Assumptions of parsimony from pruning may be too aggressive.