Biological networks; comparison, conservation, and evolutionary trees (extended abstract)

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

Volumn 3909 LNBI, Issue , 2006, Pages 30-44

  Chor, Benny ^a   Tuller, Tamir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Biological networks; Compression; Conserved regions; Metabolic networks; Network evolution; Networks' comparison; Relative description length; Tree reconstruction

Indexed keywords

BIOLOGICAL NETWORKS; CONSERVED REGIONS; METABOLIC NETWORKS; NETWORK EVOLUTION; NETWORKS' COMPARISON; RELATIVE DESCRIPTION LENGTH; TREE RECONSTRUCTION;

ALGORITHMS; IMAGE COMPRESSION; METABOLISM; MOLECULAR BIOLOGY; TREES (MATHEMATICS);

NEURAL NETWORKS;

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

References (32)

1. S. Afshar, E. Johnson, S. Viries, and I. Schroder. Properties of a thermostable nitrate reductase from the hyperthermophilic archaeon pyrobaculum aerophilum. Journal of Bacteriology, pages 5491-5495, 2001.
2. D. M. Bagly and J. M. Gossett. Tetrachloroethene transformation to trichloroethene and cis-l,2-dichloroethene by sulfate-reducing enrichment cultures. Appl. Environ. Microbio, 56(8), 1990.
3. D. Burstein, I. Ulitsky, T. Tuller, and B. Chor. Information theoretic approaches to whole genome phytogenies. RECOMB05, pages 296-310, 2005.
4. X. Chen, S. Kwong, and M. Li. A compression algorithm for dna sequences and its applications in genome comparison. RECOMB, pages 107-117, 2000.
5. 2.5) time algorithms for subgraph homeomorphisem problem on trees. J. Algorithms, 8:106-112, 1987.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, 1990.
7. J. Damborsky. Ttetrachloroethene-dehalogenating bacteria. Folia. Microbiol, 44(3), 1999.
8. NCBI Taxonomy Database, http://www.ncbi.nlm.nih.gov/entrez/linkout/ tutorial/ taxtour.html.
9. I. Elias and J. Lagergren. Fast neighbor joining. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), volume 3580 of Lecture Notes in Computer Science, pages 1263-1274. Springer-Verlag, July 2005.
10. B. Z. Fathepure and S. A. Boyd. Dependence of tetrachloroethylene dechlorination on methanogenic substrate consumption by methanosarcina sp. strain dem. Appl. Environ. Microbio, 54(12), 1988.
11. J. Felsenstein. Phylip (phytogeny inference package) version 3.5c. Distributed by the author. Department of Genetics, University of Washington, Seattle, 1993.
12. M. R. Garey and D. S. Johnson. Computers and Intractability. Bell Telephone Laboratories, 1979.
13. R. Hernandez-Rivas, D. Mattel, Y. Sterkers, D. S. Peterson, T. E. Wellems, and A. Acherf. Expressed var genes are found in plasmodium falciparum subtelomeric regions. Mol. Cell. Biol, pages 604-611, 1997.
14. P. A. Hoffee and M. E. Jones. Purin and pyrimidine nucleotide metabolism. Academic Press, 1978.
15. A. F. Hofmann. Bile acids: The good, the bad, and the ugly. News Physiol. Sci., 14, 1999.
16. H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A. L. Barabasi. The large-scale organization of metabolic networks. Nature, 407(6804):651-4, 2000.
17. M. Kanehisa and S. Goto. Kegg: Kyoto encyclopedia of genes and genomes. Nucleic Acids Res, 28:27-30, 2000.
18. B. P. Kelley, R. Sharan, R. M. Karp, T. Sittler, D. E. Root, B. R. Stock-well, and T. Ideker. Conserved pathways within bacteria and yeast as revealed by global protein network alignment. PNAS, 100:11394-11399, 2003.
19. M. Koyuturk, A. Grama, and W. Szpankowski. An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinforrnatics, 20:i200-i207, 2004.
20. D. M. Krylov, Y. I. Wolf, I. B. Rogozin, and E. V. Koonim. Gene loss, protein sequence divergence, gene dispensability, expression level, and interactivity are correlated in eukaryotic evolution. Genome Research, 13:2229-2235, 2003.
21. M. Li, J. Badger, X. Chen, S. Kwong, P. Kearney, and H. Zhang. An information-based sequence distance and its application to whole mitochondria! genome phytogeny. Bioinformatics, 17(2):149-154, 2001.
22. M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer Verlag, 2005.
23. 5/2) time. Ann. Discrete Math, 2:91106, 1978.
24. G. Michal. Biochemical pathways. John Wiley and Sons. Inc, 1999.
25. H. Ogata, W. Fujibuchi, S. Goto, and M. Kanehisa. A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Research, 28:4021-4028, 2000.
26. R. Y. Pinter, O. Rokhlenko, E. Yeger-Lotem, and M. Ziv-Ukelson. Alignment of metabolic pathways. Bioinformatics, 2005.
27. N. Saitou and M. Nei. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. EvoL, 4:406-425, 1987.
28. F. Schreiber. Comparison of metabolic pathways using constraint graph drawing. Proceedings of the Asia-Pacific Bioinformatics Conference (APBC'O3), Conferences in Research and Practice in Information Technology, 19:105-110, 2003.
29. R. Sharan, S. Suthram, R. M. Kelley, T. Kuhn, S. McCuine, P. Uetz, T. Sittler, R. M. Karp, and T. Ideker. Conserved patterns of protein interaction in multiple species. Proc. Natl. Acad. Sci. USA 102, pages 1974 - 1979, 2005.
30. M. Sipser. Introduction to the Theory of Computation. PSW Publishing Company, 1997.
31. Y. Tohsato, H. Matsuda, and A. Hashimoto. A multiple alignment algorithm for metabolic pathway analysis using enzyme hierarchy. Proc. 8th International Conference on Inelligent Systems for Molecular Biology (ISMB2000), pages 376-383, 2000.
32. U. Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication, 2000.