Name
Abstract | ||
|---|---|---|
We study a simple abstract problem motivated by a variety of applications in protein sequence analysis. Consider a string of 0s and 1s of length L, and containing 1s. If we believe that some or all of the 1s may be clustered near the start of the sequence, which subset is the most significantly so clustered, and how significant is this clustering? We approach this question using the minimum description length principle and illustrate its application by analyzing residues that distinguish translational initiation and elongation factor guanosine triphosphatases (GTPases) from other P-loop GTPases. Within a structure of yeast elongation factor 1, these residues form a significant cluster centered on a region implicated in guanine nucleotide exchange. Various biomedical questions may be cast as the abstract problem considered here. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1089/cmb.2017.0050 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | DocType | Volume |
cluster analysis,Minimum Description Length principle,Jeffreys' priors | Journal | 25.0 |
Issue | ISSN | Citations |
2 | 1066-5277 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen F Altschul | 1 | 180 | 26.55 |
| Neuwald Andrew F | 2 | 0 | 0.34 |