Hierarchical Grid Computing for High-Performance Bioinformatics

Grid Computing for Bioinformatics and Computational Biology

Volumn , Issue , 2007, Pages 87-121

  Schmidt, Bertil ^a   Chen, Chunxi ^a   Liu, Weiguo ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Dynamic load balancing approach; Hierarchical grid computing; Normal application level inter cluster bandwidth

Indexed keywords

EID: 84889956056     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470191637.ch5     Document Type: Chapter

References (36)

1. I. Foster, C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann Publishers, San Francisco, 1998.
2. N. Karonis, B. Toonen, I. Foster, MPICH-G2: A grid-enabled implementation of the message passing interface, Journal of Parallel and Distributed Computing 63(5), 551-563, 2003.
3. MPICH-G2 project, http://www3.niu.edu/mpi.
4. MPICH project, http://www-unix.mcs.anl.gov/mpi/mpich/.
5. Sun grid engine project, http://gridengine.sunsource.net/.
6. T.F. Smith, M.S.Waterman, Identification of common molecular subsequences, Journal of Molecular Biology 147, 195-197, 1981.
7. D.S. Hirschberg, A linear space algorithm for computing longest common subsequences, Communications of the ACM 18, 341-343, 1975.
8. E. Myers,W. Miller, Optimal alignments in linear space, Computer Applications in the Biosciences 4, 11-17, 1988.
9. K.M. Chao, J. Zhang, J. Ostell, W. Miller, A local alignment tool for long DNA sequences, Computer Applications in the Biosciences 11(2), 147-153, 1994.
10. A.L. Delcher, S. Kasif, R.D. Fleischmann, J. Peterson, O. White, S.L. Salzberg, Alignment of whole genomes, Nucleic Acids Research 27(11), 2369-2376, 1999.
11. C.X. Chen, B. Schmidt, An adaptive grid implementation of DNA sequence alignment, Future Generation Computer Systems-The International Journal of Grid Computing: Theory, Methods and Applications 21(7), 988-1003, 2005.
12. C.X. Chen, B. Schmidt, Constructing large suffix trees on a computational grid, Journal of Parallel Distributed Computing, 66(12), 1512-1523, 2006, doi: 10.1016/j.jpdc.2006.08.004.
13. A. Plaat, H.E. Bal, R.H.F. Hofman, Sensitivity of parallel applications to large differences in bandwidth and latency in two-layer interconnects, in Proceedings of 5th IEEE HPCA'99, Orlando, Florida, January 9-13, pp. 244-253, 1999.
14. W.R. Zhu, Y.W. Niu, J.Z. Lu, C. Shen, G.R. Gao, A cluster-based solution for high performance hmmpfam using EARTH execution model, Cluster 2003, Hong Kong, 2003.
15. Ensembl Genome Browser, http://www.ensembl.org/index.html.
16. M. Li, B. Ma, D. Kisman, J. Tromp, PatternHunter II: highly sensitive and fast homology search, Journal of Bioinformatics and Computational Biology 2(3), 417-440, 2004.
17. D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, New York, 1997.
18. S. Kurtz, Reducing space requirement of suffix trees, Software Practice and Experience, 29(13), 1149-1171, 1999.
19. GenBank, http://www.ncbi.nlm.nih.gov/genbank/.
20. D.W. Mount, Bioinformatics-Sequence and Genome Analysis, Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY, 2001.
21. C.B. Anfinsen, Principles that govern the folding of proteins, Science 181(96), 223-230, 1973.
22. W.E. Hart, S. Istrail, Robust proofs of NP-hardness for protein folding: General lattices and energy potentials, Journal of Computational Biology, 4(1), 1-22, 1997.
23. T. Dandekar, P. Argos, Folding the main chain of small proteins with the genetic algorithm, Journal of Molecular Biology 236, 844-861, 1994.
24. S.M. LeGrand, K.M. Merz, Jr, The genetic algorithm and the conformational search of polypeptides and proteins, Molecular Simulation 13, 299-320, 1994.
25. J.T. Pedersen, J. Moult, Ab initio structure prediction for small polypeptides and protein fragments using genetic algorithms, Proteins 23, 454-460, 1995.
26. S. Sun, Reduced representation of protein structure prediction: Statistical potential and genetic algorithms, Protein Science 2, 762-785, 1993.
27. R. Unger, J. Moult, Genetic algorithms for protein folding simulations, Journal of Molecular Biology 231, 75-81, 1993.
28. E.E. Santos, E. Santos, Jr., Reducing the computational load of energy evaluations for protein folding, in 4th IEEE Symposium on Bioinformatics and Bioengineering, 2004.
29. K.A. Dill, S. Bromberg, K. Yue, K.M. Fiebig, D.P. Yee, P.D. Thomas, H.S. Chan, Principles of protein folding: A perspective from simple exact models, Protein Science 4(4), 561-602, 1995.
30. W.E. Hart, A. Newman, The Computational Complexity of Protein Structure Prediction in Simple Lattice Models, CRC Press, Boca Raton, FL, 2003.
31. K.F. Lau, K.A. Dill, A lattice statistical mechanics model of the conformational and sequence spaces of proteins, Macromelecules 22, 3986-3997, 1989.
32. E. Cantu-Paz, A survey of parallel genetic algorithms, Calculateurs Paralleles, Reseaux et Systems Repartis 10(2), 141-171, 1998.
33. B.Wilkinson, M. Allen, Parallel Programming-Techniques and Applications Using Networked Workstations and Parallel Computers, Prentice-Hall, Upper Saddle River, NJ, 2005.
34. W. Liu, B. Schmidt, Parallel pattern-based systems for computational biology: A case study, IEEE Transactions on Parallel and Distributed Systems 17(8), 750-763, 2006.
35. G. Almasi, A. Gottlieb, Highly Parallel Computing, Benjamin/Cummings Publishing Company, San Francisco, 1994.
36. R. Shonkwiler, Parallel genetic algorithms, 5th International Conference on Genetic Algorithms, 1992.