LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Chordal graphs in computational biology – new insights and applications
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
An important connection between network motifs and parsimony models
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
| Hi-index | 0.00 |
We study properties of multidomain proteins from a graph theoretical perspective. In particular, we demonstrate connections between properties of the domain overlap graph and certain variants of Dollo parsimony models. We apply our graph theoretical results to address several interrelated questions: do proteins acquire new domains infrequently, or often enough that the same combinations of domains will be created repeatedly through independent events? Once domain architectures are created, do they persist? In other words, is the existence of ancestral proteins with domain compositions not observed in contemporary proteins unlikely? Our experimental results indicate that independent merges of domain pairs are not uncommon in large superfamilies.