Local DNA sequence alignment in a cluster of workstations: Algorithms and tools

Journal of the Brazilian Computer Society

Volumn 10, Issue 2, 2004, Pages 81-88

  Melo, Alba Cristina M A ^a,b   Walter, Maria Emilia M T ^a,b   Melo, Renata Cristina F ^a,b   Santana, Marcelo N P ^a,b   Batista, Rodolfo B ^a,b  

^a UNIVERSITY OF BRASILIA   (Brazil)

^b Campus Universitario ICC Norte Subsolo ^*  (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ALIGNMENT; BENCHMARKING; BIOINFORMATICS; DISTRIBUTED COMPUTER SYSTEMS; DNA; GENE ENCODING; HEURISTIC METHODS; MEMORY ARCHITECTURE;

CLUSTER OF WORKSTATIONS; DISTRIBUTED ARCHITECTURE; DISTRIBUTED SHARED MEMORY SYSTEMS; DNA SEQUENCE ALIGNMENTS; PARALLELIZATION STRATEGIES; RELAXED MEMORY MODELS; SHARED MEMORY PROGRAMMING; SYNCHRONIZATION OPERATION;

DNA SEQUENCES;

EID: 84860503704     PISSN: 01046500     EISSN: 16784804     Source Type: Journal    
DOI: 10.1007/BF03192360     Document Type: Article

References (16)

1. S. F. Altschul et al. Gapped blast and psi-blast: a new generation of protein database search programs.Nucleic Acids Research, 25(17):3389–3402, 1997.
2. I. Foster.Designing and Building Parallel Programs. Addison-Wesley, 1995.
3. K. Gharachorloo. Memory consistency and event ordering in scalable shared-memory multiprocessors. InInt. Symp. On Computer Architecture (ISCA), pages 15–24. ACM, 1990.
4. S. Hu, W. Shi, and Z. Tang. Jiajia: An svm system based on a new cache coherence protocol. InHigh Performance Computing and Networking (HPCN), pages 463–472. Springer-Verlag, 1999.
5. W. Hu and W. Shi. Jiajia users manual. Technical report, Chinese Academy of Sciences, 1999.
6. L. Iftode, J. Singh, and K. Li. Scope consistency: Bridging the gap between release consistency and entry consistency. In8th ACM SPAA’96, pages 277–287. ACM, 1996.
7. K. Li.Shared Virtual Memory on Loosely Coupled Architectures. PhD thesis, Yale University, 1986.
8. W. S. Martins, J. B. Del Cuvillo, F. J. Useche, K. B. Theobald, and G. R. Gao. A multithread parallel implementation of a dynamic programming algorithm for sequence comparison. InBrazilian Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), pages 1–8, 2001.
9. R. Melo, M. E. T. Walter, A. C. M. A. Melo, and R. B. Batista. Comparing two long dna sequences using a dsm system. InEuro-Par 2003, pages 517–524. Springer-Verlag, 2003.
10. D. Mosberger. Memory consistency models.Operating Systems Review, pages 18–26, 1993.
11. S. B. Needleman and C. D. Wunsh. A general method applicable to the search of similarities of amino acid sequences of two proteins.Journal of Molecular Biology, (48):443–453, 1970.
12. W. R. Pearson and D. L. Lipman. Improved tools for biological sequence comparison. InProceedings Of The National Academy Of Science USA, pages 2444–2448. NAS, 1988.
13. G. Pfister.In Search of Clusters — The Coming Battle for Lowly Parallel Computing. Prentice-Hall, 1995.
14. J. C. Setubal and J. Meidanis.Introduction to Computational Molecular Biology. Brooks/Cole Publishing Company, 1997.
15. T. F. Smith and M. S. Waterman. Identification of common molecular sub-sequences.Journal of Molecular Biology, (147):195–197, 1981.
16. E. Speight and J. Bennet. Brazos: a third generation dsm system. InUSENIX/WindowsNT Workshop, pages 95–106, 1997.