Mathematical model for empirically optimizing large scale production of soluble protein domains

Background: Efficient dissection of large proteins into their structural domains is critical for high throughput proteome analysis. So far, no study has focused on mathematically modeling a protein dissection protocol in terms of a production system. Here, we report a mathematical model for empirically optimizing the cost of large-scale domain production in proteomics research. Results: The model computes the expected number of successfully producing soluble domains, using a conditional probability between domain and boundary identification. Typical values for the model's parameters were estimated using the experimental results for identifying soluble domains from the 2,032 Kazusa HUGE protein sequences. Among the 215 fragments corresponding to the 24 domains that were expressed correctly, 111, corresponding to 18 domains, were soluble. Our model indicates that, under the conditions used in our pilot experiment, the probability of correctly predicting the existence of a domain wa...

• Type: Journal
• Year: 2010
• Where: BMCBI
• Authors: Eisuke Chikayama, Atsushi Kurotani, Takanori Tanaka, Takashi Yabuki, Satoshi Miyazaki, Shigeyuki Yokoyama, Yutaka Kuroda
• Keywords: BMCBI 2010, Protein, Protein Dissection Protocols, Soluble Domains