A parallel strategy for biological sequence alignment in restricted memory space
作者： Rodolfo Bezerra Batista , Azzedine Boukerche , Alba Cristina Magalhaes Alves de Melo
DOI: 10.1016/J.JPDC.2007.08.007
关键词:
摘要: … memory. The algorithm proposed by Smith–Waterman (SW) is an exact method that obtains optimal local alignments in quadratic space … memory space, where the amount of memory …
elsevier.com
sci-hub.se 参考文章(25)
Kevin Charter, Duane Szafron, Jonathan Schae, Sequence Alignment using FastLSA ,(2000)
Peiyi Tang, Pen-Chung Yew, Processor self-scheduling for multiple-nested parallel loops international conference on parallel processing. pp. 528- 535 ,(1986)
Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincon, Thomas M. Santana, Parallel smith-waterman algorithm for local DNA comparison in a cluster of workstations Lecture Notes in Computer Science. pp. 464- 475 ,(2005) , 10.1007/11427186_40
Gregory F. Pfister, In search of clusters: the coming battle in lowly parallel computing Prentice-Hall, Inc.. ,(1995)
A. Apostolio, C. Guerra, A Fast Linear Space Algorithm for Computing Longest Common Subsequences ,(1985)
Joao Carlos Setubal, Joao Meidanis, . ̤ Setubal-Meidanis, Introduction to Computational Molecular Biology ,(1997)
Renata Cristina F. Melo, Maria Emília Telles Walter, Alba Cristina Magalhaes Alves Melo, Rodolfo Batista, Marcelo Nardelli, Thelmo Martins, Tiago Fonseca, Comparing Two Long Biological Sequences Using a DSM System european conference on parallel processing. pp. 517- 524 ,(2003) , 10.1007/978-3-540-45209-6_74
Stephen F. Altschul, Bruce W. Erickson, OPTIMAL SEQUENCE ALIGNMENT USING AFFINE GAP COSTS Bulletin of Mathematical Biology. ,vol. 48, pp. 603- 616 ,(1986) , 10.1007/BF02462326
Dan Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology ,(1997)
Gonzalo Navarro, A guided tour to approximate string matching ACM Computing Surveys. ,vol. 33, pp. 31- 88 ,(2001) , 10.1145/375360.375365