An important connection between network motifs and parsimony models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3909 LNBI, Issue , 2006, Pages 321-335

  Przytycka, Teresa M ^a  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER OVERLAP GRAPH; COELOMATA HYPOTHESIS; EVOLUTIONARY TREE; PARSIMONY METHOD; PHYLOGENY;

ACOUSTIC NOISE; COMPUTATIONAL COMPLEXITY; DNA; GRAPH THEORY; PROTEINS;

TREES (MATHEMATICS);

EID: 33745767044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11732990_27     Document Type: Conference Paper

References (34)

1. A. Adoutte, G. Balavoine, N. Lartillot, O. Lespinet, Benjamin Prud'homme, and Renaud de Rosa. Special Feature: The new animal phylogeny: Reliability and implications. PNAS, 97(9):4453-4456, 2000.
2. A.M. Aguinaldo, J.M. Turbeville, L.S. Linford, M.C. Rivera, J.R. Garey, R.A. Raff, and J.A. Lake. Evidence for a clade of nematodes, arthropods and other moulting animals. Nature, 387:489-93, 1997.
3. G. Apic, W. Huber, and S.A. Teichmann. Multi-domain protein families and domain pairs: Comparison with known structures and a random model of domain recombination. J. Struc. Func. Genomics, 4:67-78, 2003.
4. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
5. Jaime Blair, Kazuho Ikeo, Takashi Gojobori, and S Blair Hedges. The evolutionary position of nematodes. BMC Evolutionary Biology, 2(1):7, 2002.
6. B. Boeckmann, A. Bairoch, R. Apweiler, M.-C. Blatter, A. Estreicher, E. Gasteiger, M.J. Martin, K. Michoud, C. O'Donovan, I. Phan, S. Pilbout, and M. Schneider. The SWISS-PROT protein knowledgebase and its supplement TrEMBL in 2003. Nucleic Acids Res., 31:365-370, 2003.
7. P. Buneman. A characterisation of rigid circuit graphs. Discrete Math., 9:205-212, 1974.
8. J. H. Camin and R.R. Sokal. A method for deducting branching sequences in phytogeny. Evolution, 19:311-326, 1965.
9. W.H.E. Day, D. Johnson, and D. Sankoff. The computational complexity of inferring rooted phytogenies by parsimony. Mathematical Biosciences, 81:33-42, 1986.
10. E.J. Deeds, Hooman Hennessey, and Eugene I. Shakhnovich. Prokaryotic phytogenies inferred from protein structural domains. Genome Res., 15(3):393-402, 2005.
11. J. Felsenstein. Inferring Phylogenies. Sinauer Associates, 2004.
12. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory (B), 16:47-56, 1974.
13. L.Y. Geer, M. Domrachev, D.J. Lipman, and S.H. Bryant. CDART: protein homology by domain architecture. Genome Res., 12(10):1619-23, 2002.
14. M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
15. J.S.Farris. Phylogenetic analysis under Dollo's law. Systematic Zoology, 26(1):77-88, 1977.
16. I. Letunic, L. Goodstadt, N.J. Dickens, T. Doerks, J. Schultz, R. Mott, F. Ciccarelli, R.R. Copley, C.P. Ponting, and P. Bork P. Recent improvements to the SMART domain-based sequence annotation resource. Nucleic Acids Res., 31(l):242-244, 2002.
17. J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP- complete. J. Comput. Syst. Sci., 20(2):219-230, 1980.
18. T.A. McKee and F.R. McMorris. Topics in intersection graph theory, SIAM Monographs on Discrete Mathematics and Applications, 1999.
19. F.R. McMorris, T. Warnow, and T. Wimer. Triangulating vertex colored graphs. SIAM J. on Discrete Mathematics, 7(2).-296-306, 1994.
20. K. Mehlhorn and S. Naher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
21. M. Middendorf, E. Ziv, and C. H. Wiggins. From The Cover: Inferring network mechanisms: The Drosophila melanogaster protein interaction network. PNAS, 102(9):3192-3197, 2005.
22. R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen-Orr, I. Ayzenshtat, M. Sheffer, and U. Alon. Superfamilies of Evolved and Designed Networks. Science, 303(5663): 1538-1542, 2004.
23. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network Motifs: Simple Building Blocks of Complex Networks. Science, 298(5594):824-827, 2002.
24. N. Przulj, D. G. Corneil, and I. Jurisica. Modeling interactome: scale-free or geometric? Bioinformatics, 20(18):3508-3515, 2004.
25. T.M. Przytycka, G. Davis, N. Song, and D. Durand. Graph theoretical insight into evolution of multidomain proteins. Lecture Notes in Computational Biology (RECOMB 2005), 3500:311321, 2005.
26. T.M. Przytycka and Y.K. Yu. Scale-free networks versus evolutionary drift. Computational Biology and Chemistry, 28:257-264, 2004.
27. I.B. Rogozin, I.Y Wolf, A.V. Sorokin, B.C. Mirkin, and V Koonin, E. Remarkable interkingdom conservation of intron positions and massive, lineage-specific intron loss and gain in eukaryotic evolution. Current Biology, 13:1512-1517, 2003.
28. R. Tatusov, N. Fedorova, J. Jackson, A. Jacobs, B. Kiryutin, E. Koonin, D. Krylov, R. Mazumder, S. Mekhedov, A. Nikolskaya, B.S. Rao, S. Smirnov, A. Sverdlov, S. Vasudevan, Y. Wolf, J. Yin, and D. Natale. The cog database: an updated version includes eukaryotes. BMC Bioinformatics, 4(1):41, 2003.
29. Henry F. Winstanley, Sanne Abeln, and Charlotte M. Deane. How old is your fold? Bioinformatics, 21(suppll):i449-458, 2005.
30. Y.I. Wolf, I.B. Rogozin, and E.V. Koonin. Coelomata and Not Ecdysozoa: Evidence From Genome-Wide Phylogenetic Analysis. Genome Res., 14(l):29-36, 2004.
31. S. Wuchty. Scale-free behavior in protein domain networks. Mol. Biol. Evol., 18:1694-1702, 2001.
32. S. Wuchty and E. Almaas. Evolutionary cores of domain co-occurrence networks. BMC Evolutionary Biology, 5(1):24, 2005.
33. M. Yannakakis. Computing the minimum fill-in is NP- complete. SIAM J. Alg and Discrete Math, 2:77-79, 1981.
34. E. Yeger-Lotem, S. Sattath, N. Kashtan, S. Itzkovitz, R. Milo, R. Y. Pinter, U. Alon, and H. Margalit. Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction. PNAS, 101(16):5934-5939, 2004.