Skip to main content

Proteome Complexity Measures Based on Counting of Domain-to-Protein Links for Replicative and Non-Replicative Domains

  • Chapter
Bioinformatics of Genome Regulation and Structure II

Abstract

The entire protein domain set of the proteome of an organism we call the domainome. We define the list of domains in domainome, together with the numbers of their occurrences (links to proteins) found in the proteome to be the domain-to-protein linkage profile (DPLP). We estimated the DPLP of the proteomes of the 156 complete genomes represented in the InterPro database. This work presents several quantitative measures of the complexity of a proteome based on the DPLP. For each of the 156 studied genomes, we found two large sets of domains: D1, the domains that are not replicated within any protein of the proteome and D2, the domains that occur two or more times in at least one protein of the proteome. Statistics of the observed domain-to-protein links (DPLs) for set D1 and set D2 do not exhibit simple ‘scale-free network’ properties: for D1, the distribution of DPLs in proteome follows the Generalized Discrete Pareto function and for D2, the distribution of DPLs in proteome follows the inversed gamma probability function. Dynamical range of DPLs for D1 domains is larger than for D2 domains, and this range correlates with biological complexity of organism. D1 and D2 sets exhibit significant differences of molecular functions of the corresponding proteins, biological processes, and cellular components. The statistical distributions of the number of DPLs in the proteome and the estimates of the differences between the DPLPs for pairs of organisms are used as measures of relative biological complexity of the organisms. In particular, we show quantitatively the greater domain composition complexity of the human proteins relative to that of a mouse or a rat.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Kuznetsov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Kuznetsov, V.A., Pickalov, V.V., Kanapin, A.A. (2006). Proteome Complexity Measures Based on Counting of Domain-to-Protein Links for Replicative and Non-Replicative Domains. In: Kolchanov, N., Hofestaedt, R., Milanesi, L. (eds) Bioinformatics of Genome Regulation and Structure II. Springer, Boston, MA. https://doi.org/10.1007/0-387-29455-4_32

Download citation

Publish with us

Policies and ethics