A Network of SCOP Hidden Markov Models and Its Analysis
<p>Abstract</p> <p>Background</p> <p>The Structural Classification of Proteins (SCOP) database uses a large number of hidden Markov models (HMMs) to represent families and superfamilies composed of proteins that presumably share the same evolutionary origin. However, ho...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2011-05-01
|
| Series: | BMC Bioinformatics |
| Online Access: | http://www.biomedcentral.com/1471-2105/12/191 |
| _version_ | 1818918656109707264 |
|---|---|
| author | Watson Layne T Zhang Liqing Heath Lenwood S |
| author_facet | Watson Layne T Zhang Liqing Heath Lenwood S |
| author_sort | Watson Layne T |
| collection | DOAJ |
| description | <p>Abstract</p> <p>Background</p> <p>The Structural Classification of Proteins (SCOP) database uses a large number of hidden Markov models (HMMs) to represent families and superfamilies composed of proteins that presumably share the same evolutionary origin. However, how the HMMs are related to one another has not been examined before.</p> <p>Results</p> <p>In this work, taking into account the processes used to build the HMMs, we propose a working hypothesis to examine the relationships between HMMs and the families and superfamilies that they represent. Specifically, we perform an all-against-all HMM comparison using the HHsearch program (similar to BLAST) and construct a network where the nodes are HMMs and the edges connect similar HMMs. We hypothesize that the HMMs in a connected component belong to the same family or superfamily more often than expected under a random network connection model. Results show a pattern consistent with this working hypothesis. Moreover, the HMM network possesses features distinctly different from the previously documented biological networks, exemplified by the exceptionally high clustering coefficient and the large number of connected components.</p> <p>Conclusions</p> <p>The current finding may provide guidance in devising computational methods to reduce the degree of overlaps between the HMMs representing the same superfamilies, which may in turn enable more efficient large-scale sequence searches against the database of HMMs.</p> |
| first_indexed | 2024-12-20T00:53:25Z |
| format | Article |
| id | doaj.art-642fadad25694915a32fa9201eb3c72e |
| institution | Directory Open Access Journal |
| issn | 1471-2105 |
| language | English |
| last_indexed | 2024-12-20T00:53:25Z |
| publishDate | 2011-05-01 |
| publisher | BMC |
| record_format | Article |
| series | BMC Bioinformatics |
| spelling | doaj.art-642fadad25694915a32fa9201eb3c72e2022-12-21T19:59:10ZengBMCBMC Bioinformatics1471-21052011-05-0112119110.1186/1471-2105-12-191A Network of SCOP Hidden Markov Models and Its AnalysisWatson Layne TZhang LiqingHeath Lenwood S<p>Abstract</p> <p>Background</p> <p>The Structural Classification of Proteins (SCOP) database uses a large number of hidden Markov models (HMMs) to represent families and superfamilies composed of proteins that presumably share the same evolutionary origin. However, how the HMMs are related to one another has not been examined before.</p> <p>Results</p> <p>In this work, taking into account the processes used to build the HMMs, we propose a working hypothesis to examine the relationships between HMMs and the families and superfamilies that they represent. Specifically, we perform an all-against-all HMM comparison using the HHsearch program (similar to BLAST) and construct a network where the nodes are HMMs and the edges connect similar HMMs. We hypothesize that the HMMs in a connected component belong to the same family or superfamily more often than expected under a random network connection model. Results show a pattern consistent with this working hypothesis. Moreover, the HMM network possesses features distinctly different from the previously documented biological networks, exemplified by the exceptionally high clustering coefficient and the large number of connected components.</p> <p>Conclusions</p> <p>The current finding may provide guidance in devising computational methods to reduce the degree of overlaps between the HMMs representing the same superfamilies, which may in turn enable more efficient large-scale sequence searches against the database of HMMs.</p>http://www.biomedcentral.com/1471-2105/12/191 |
| spellingShingle | Watson Layne T Zhang Liqing Heath Lenwood S A Network of SCOP Hidden Markov Models and Its Analysis BMC Bioinformatics |
| title | A Network of SCOP Hidden Markov Models and Its Analysis |
| title_full | A Network of SCOP Hidden Markov Models and Its Analysis |
| title_fullStr | A Network of SCOP Hidden Markov Models and Its Analysis |
| title_full_unstemmed | A Network of SCOP Hidden Markov Models and Its Analysis |
| title_short | A Network of SCOP Hidden Markov Models and Its Analysis |
| title_sort | network of scop hidden markov models and its analysis |
| url | http://www.biomedcentral.com/1471-2105/12/191 |
| work_keys_str_mv | AT watsonlaynet anetworkofscophiddenmarkovmodelsanditsanalysis AT zhangliqing anetworkofscophiddenmarkovmodelsanditsanalysis AT heathlenwoods anetworkofscophiddenmarkovmodelsanditsanalysis AT watsonlaynet networkofscophiddenmarkovmodelsanditsanalysis AT zhangliqing networkofscophiddenmarkovmodelsanditsanalysis AT heathlenwoods networkofscophiddenmarkovmodelsanditsanalysis |