메뉴 건너뛰기




Volumn 43, Issue 4, 2013, Pages 350-361

A data parallel strategy for aligning multiple biological sequences on multi-core computers

Author keywords

Biological sequences; Clustering; Data parallelism; Multi core; Multiple sequence alignment; Parallel algorithm

Indexed keywords

BIOLOGICAL SEQUENCES; CLUSTERING; DATA PARALLELISM; MULTI CORE; MULTIPLE SEQUENCE ALIGNMENTS;

EID: 84875376355     PISSN: 00104825     EISSN: 18790534     Source Type: Journal    
DOI: 10.1016/j.compbiomed.2012.12.009     Document Type: Article
Times cited : (21)

References (45)
  • 2
    • 33845711431 scopus 로고    scopus 로고
    • Parallel strategies for the local biological sequence alignment in a cluster of workstations
    • Azzedine B., Alba C., Mauricio A.-R., Maria E. Parallel strategies for the local biological sequence alignment in a cluster of workstations. J. Parallel Distrib. Comput. 2007, 67:170-185.
    • (2007) J. Parallel Distrib. Comput. , vol.67 , pp. 170-185
    • Azzedine, B.1    Alba, C.2    Mauricio, A.-R.3    Maria, E.4
  • 3
    • 77957353024 scopus 로고    scopus 로고
    • Clustalxeed. a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
    • Taecho K., Hyun j. Clustalxeed. a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment. BMC Bioinformatics 2010, 11:467.
    • (2010) BMC Bioinformatics , vol.11 , pp. 467
    • Taecho, K.1    Hyun, J.2
  • 4
    • 29444435065 scopus 로고    scopus 로고
    • Aligning biological sequences on distributed bus networks. a divisible load scheduling approach
    • Wong H.M., Bharadwaj V. Aligning biological sequences on distributed bus networks. a divisible load scheduling approach. IEEE Trans. Inf. Technol. Biomed. 2005, 9(4):489-501.
    • (2005) IEEE Trans. Inf. Technol. Biomed. , vol.9 , Issue.4 , pp. 489-501
    • Wong, H.M.1    Bharadwaj, V.2
  • 5
    • 68849122267 scopus 로고    scopus 로고
    • Handling biological sequence alignments on networked computing systems. a divide-and-conquer approach
    • Bharadwaj V., Wong H.M. Handling biological sequence alignments on networked computing systems. a divide-and-conquer approach. J. Parallel Distrib. Comput. 2009, 69:854-865.
    • (2009) J. Parallel Distrib. Comput. , vol.69 , pp. 854-865
    • Bharadwaj, V.1    Wong, H.M.2
  • 6
    • 34547226808 scopus 로고    scopus 로고
    • On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures
    • Diana H.P.L., Bharadwaj V., David A.B. On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures. J. Parallel Distrib. Comput. 2007, 67:1007-1017.
    • (2007) J. Parallel Distrib. Comput. , vol.67 , pp. 1007-1017
    • Diana, H.P.L.1    Bharadwaj, V.2    David, A.B.3
  • 7
    • 77955034236 scopus 로고    scopus 로고
    • Cloud-coffee. implementation of a parallel consistency-based multiple alignment algorithm in the t-coffee package and its benchmarking on the amazon elastic-cloud
    • Tommaso D.P., Orobitg M., Guirado F., Cores F., Espinosa T., Notredame C. Cloud-coffee. implementation of a parallel consistency-based multiple alignment algorithm in the t-coffee package and its benchmarking on the amazon elastic-cloud. Bioinformatics 2010, 26(15):1903-1904.
    • (2010) Bioinformatics , vol.26 , Issue.15 , pp. 1903-1904
    • Tommaso, D.P.1    Orobitg, M.2    Guirado, F.3    Cores, F.4    Espinosa, T.5    Notredame, C.6
  • 9
    • 0027968068 scopus 로고
    • CLUSTAL W. improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice
    • Thompson J.D., Higgins D.G., Gibson T.J. CLUSTAL W. improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 1994, 22:4673-4680.
    • (1994) Nucleic Acids Res. , vol.22 , pp. 4673-4680
    • Thompson, J.D.1    Higgins, D.G.2    Gibson, T.J.3
  • 10
    • 0034623005 scopus 로고    scopus 로고
    • T-coffee. a novel method for fast and accurate multiple sequence alignment
    • Notredame C., Higgins D.G., Heringa J. T-coffee. a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 2000, 302:205-217.
    • (2000) J. Mol. Biol. , vol.302 , pp. 205-217
    • Notredame, C.1    Higgins, D.G.2    Heringa, J.3
  • 11
    • 3042666256 scopus 로고    scopus 로고
    • MUSCLE. multiple sequence alignment with high accuracy and high throughput
    • Robert C.E. MUSCLE. multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 2004, 32(5):1782-1797.
    • (2004) Nucleic Acids Res. , vol.32 , Issue.5 , pp. 1782-1797
    • Robert, C.E.1
  • 12
    • 14644430471 scopus 로고    scopus 로고
    • Probcons. probabilistic consistency-based multiple sequence alignment
    • Chuong B.D., Mahathi S.P.M., Michael B., Serafim B. Probcons. probabilistic consistency-based multiple sequence alignment. Genome Res. 2005, 15:330-340.
    • (2005) Genome Res. , vol.15 , pp. 330-340
    • Chuong, B.D.1    Mahathi, S.P.M.2    Michael, B.3    Serafim, B.4
  • 13
    • 45949107473 scopus 로고    scopus 로고
    • Recent developments in the MAFFT multiple sequence alignment program
    • Kazutaka K., Hiroyuki T. Recent developments in the MAFFT multiple sequence alignment program. Briefings Bioinformatics 2008, 9:286-298.
    • (2008) Briefings Bioinformatics , vol.9 , pp. 286-298
    • Kazutaka, K.1    Hiroyuki, T.2
  • 14
    • 33750001271 scopus 로고    scopus 로고
    • MUMMALS. multiple sequence alignment improved by using hidden Markov models with local structural information
    • Jimin P., Nick G.V. MUMMALS. multiple sequence alignment improved by using hidden Markov models with local structural information. Nucleic Acids Res. 2006, 34:4364-4374.
    • (2006) Nucleic Acids Res. , vol.34 , pp. 4364-4374
    • Jimin, P.1    Nick, G.V.2
  • 15
    • 77956098140 scopus 로고    scopus 로고
    • PicXAA. greedy probabilistic construction of maximum expected accuracy alignment of multiple sequences
    • Sayed M.E.S., Byung-Jun Y. PicXAA. greedy probabilistic construction of maximum expected accuracy alignment of multiple sequences. Nucleic Acids Res. 2010, 38(15):4917-4928.
    • (2010) Nucleic Acids Res. , vol.38 , Issue.15 , pp. 4917-4928
    • Sayed, M.E.S.1    Byung-Jun, Y.2
  • 16
    • 0041386069 scopus 로고    scopus 로고
    • CLUSTALW-MPI. CLUSTALW analysis using distributed and parallel computing
    • Kuo-Bin L. CLUSTALW-MPI. CLUSTALW analysis using distributed and parallel computing. Bioinformatics 2003, 19(12):1585-1586.
    • (2003) Bioinformatics , vol.19 , Issue.12 , pp. 1585-1586
    • Kuo-Bin, L.1
  • 18
    • 67349217354 scopus 로고    scopus 로고
    • A domain decomposition strategy for alignment of multiple biological sequences on multiprocessor platforms
    • Fahad S., Ashfaq K. A domain decomposition strategy for alignment of multiple biological sequences on multiprocessor platforms. J. Parallel Distrib. Comput. 2009, 69:666-677.
    • (2009) J. Parallel Distrib. Comput. , vol.69 , pp. 666-677
    • Fahad, S.1    Ashfaq, K.2
  • 19
    • 77955019084 scopus 로고    scopus 로고
    • Parallelization of the MAFFT multiple sequence alignment program
    • Kazutaka K., Hiroyuki T. Parallelization of the MAFFT multiple sequence alignment program. Bioinformatics 2010, 26(15):1899-1900.
    • (2010) Bioinformatics , vol.26 , Issue.15 , pp. 1899-1900
    • Kazutaka, K.1    Hiroyuki, T.2
  • 20
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • Needleman S.B., Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 1970, 48:443-453.
    • (1970) J. Mol. Biol. , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 21
    • 77949612509 scopus 로고    scopus 로고
    • Next-generation bioinformatics. using many-core processor architecture to develop a web service for sequence alignment
    • Sergio G., David D., Pilar H., Francisco J.E., Juan A.C., Gabriel D. Next-generation bioinformatics. using many-core processor architecture to develop a web service for sequence alignment. Bioinformatics 2010, 26(15):683-686.
    • (2010) Bioinformatics , vol.26 , Issue.15 , pp. 683-686
    • Sergio, G.1    David, D.2    Pilar, H.3    Francisco, J.E.4    Juan, A.C.5    Gabriel, D.6
  • 22
    • 3242891684 scopus 로고    scopus 로고
    • Dialign. multiple DNA and protein sequence alignment at bibiserv
    • Burkhard M. Dialign. multiple DNA and protein sequence alignment at bibiserv. Nucleic Acids Res. 2004, 32:33-36.
    • (2004) Nucleic Acids Res. , vol.32 , pp. 33-36
    • Burkhard, M.1
  • 23
    • 77951701991 scopus 로고    scopus 로고
    • A hardware accelerator for the fast retrieval of dialign biological sequence alignments in linear space
    • Azzedine B., Jan M.C., de Melo Alba C.M.A., Ricardo P.J. A hardware accelerator for the fast retrieval of dialign biological sequence alignments in linear space. IEEE Trans. Comput. 2010, 59(6):808-821.
    • (2010) IEEE Trans. Comput. , vol.59 , Issue.6 , pp. 808-821
    • Azzedine, B.1    Jan, M.C.2    de Melo Alba, C.M.A.3    Ricardo, P.J.4
  • 24
    • 72949094007 scopus 로고    scopus 로고
    • Network-on-chip hardware accelerators for biological sequence alignment
    • Souradip S., Gaurav R.K., Partha P.P., Ananth K. Network-on-chip hardware accelerators for biological sequence alignment. IEEE Trans. Comput. 2010, 59(1):29-41.
    • (2010) IEEE Trans. Comput. , vol.59 , Issue.1 , pp. 29-41
    • Souradip, S.1    Gaurav, R.K.2    Partha, P.P.3    Ananth, K.4
  • 26
    • 38849131252 scopus 로고    scopus 로고
    • High-throughput sequence alignment using graphics processing units
    • Michael C.S., Cole T., Arthur L.D., Amitabh V. High-throughput sequence alignment using graphics processing units. BMC Bioinformatics 2007, 8:474.
    • (2007) BMC Bioinformatics , vol.8 , pp. 474
    • Michael, C.S.1    Cole, T.2    Arthur, L.D.3    Amitabh, V.4
  • 27
    • 65549104397 scopus 로고    scopus 로고
    • A roadmap of clustering algorithms. finding a match for a biomedical application
    • Bill A., Aijun A., Xiaogang W., Michael S. A roadmap of clustering algorithms. finding a match for a biomedical application. Briefings Bioinformatics 2009, 10(3):297-314.
    • (2009) Briefings Bioinformatics , vol.10 , Issue.3 , pp. 297-314
    • Bill, A.1    Aijun, A.2    Xiaogang, W.3    Michael, S.4
  • 28
    • 33745634395 scopus 로고    scopus 로고
    • Cd-hit. a fast program for clustering and comparing large sets of protein or nucleotide sequences
    • Weizhong L., Adam G. Cd-hit. a fast program for clustering and comparing large sets of protein or nucleotide sequences. Bioinformatics 2006, 22(13):1658-1659.
    • (2006) Bioinformatics , vol.22 , Issue.13 , pp. 1658-1659
    • Weizhong, L.1    Adam, G.2
  • 29
    • 77957244650 scopus 로고    scopus 로고
    • Search and clustering orders of magnitude faster than blast
    • Robert C.E. Search and clustering orders of magnitude faster than blast. Bioinformatics 2010, 26(19):2460-2461.
    • (2010) Bioinformatics , vol.26 , Issue.19 , pp. 2460-2461
    • Robert, C.E.1
  • 30
    • 79955013072 scopus 로고    scopus 로고
    • Ultra-fast sequence clustering from similarity networks with SiLix
    • Vincent M., Simon P., Laurent D. Ultra-fast sequence clustering from similarity networks with SiLix. BMC Bioinformatics 2011, 12:116-124.
    • (2011) BMC Bioinformatics , vol.12 , pp. 116-124
    • Vincent, M.1    Simon, P.2    Laurent, D.3
  • 31
    • 34548605214 scopus 로고    scopus 로고
    • CLUSS. clustering of protein sequences based on a new similarity measure
    • Abdellali K., Shengrui W., Ryszard B., Alain F. CLUSS. clustering of protein sequences based on a new similarity measure. BMC Bioinformatics 2007, 8:286-304.
    • (2007) BMC Bioinformatics , vol.8 , pp. 286-304
    • Abdellali, K.1    Shengrui, W.2    Ryszard, B.3    Alain, F.4
  • 32
    • 84867684415 scopus 로고    scopus 로고
    • Protein sequence redundancy reduction. comparison of various methods
    • Kresimir S., Oliviero C. Protein sequence redundancy reduction. comparison of various methods. Bioinformation 2010, 5(6):234-239.
    • (2010) Bioinformation , vol.5 , Issue.6 , pp. 234-239
    • Kresimir, S.1    Oliviero, C.2
  • 33
    • 79959655657 scopus 로고    scopus 로고
    • DNACLUST. accurate and efficient clustering of phylogenetic marker genes
    • Mohammadreza G., Bo L., Mihai P. DNACLUST. accurate and efficient clustering of phylogenetic marker genes. BMC Bioinformatics 2011, 12:271-281.
    • (2011) BMC Bioinformatics , vol.12 , pp. 271-281
    • Mohammadreza, G.1    Bo, L.2    Mihai, P.3
  • 34
    • 0031857684 scopus 로고    scopus 로고
    • Rose. generating sequence families
    • Jens S., Dirk E., Folker M. Rose. generating sequence families. Bioinformatics 1998, 14(2):157-163.
    • (1998) Bioinformatics , vol.14 , Issue.2 , pp. 157-163
    • Jens, S.1    Dirk, E.2    Folker, M.3
  • 35
    • 0026691182 scopus 로고
    • The rapid generation of mutation data matrices from protein sequences
    • Jones D.T., Taylor W.R., Thornton J.M. The rapid generation of mutation data matrices from protein sequences. BMC Bioinformatics 1991, 8(3):275-282.
    • (1991) BMC Bioinformatics , vol.8 , Issue.3 , pp. 275-282
    • Jones, D.T.1    Taylor, W.R.2    Thornton, J.M.3
  • 36
    • 0036134748 scopus 로고    scopus 로고
    • Estimating amino acid substitution models. a comparison of dayhoff's estimator, the resolvent approach and a maximum likelihood method
    • Tobias M., Rainer S., Martin V. Estimating amino acid substitution models. a comparison of dayhoff's estimator, the resolvent approach and a maximum likelihood method. Mol. Biol. Evol. 2002, 19(1):8-13.
    • (2002) Mol. Biol. Evol. , vol.19 , Issue.1 , pp. 8-13
    • Tobias, M.1    Rainer, S.2    Martin, V.3
  • 37
    • 24644457706 scopus 로고    scopus 로고
    • Balibase 3.0. latest developments of the multiple sequence alignment benchmark
    • Julie D.T., Patrice K., Raymond R., Olivier P. Balibase 3.0. latest developments of the multiple sequence alignment benchmark. Proteins 2005, 61:127-136.
    • (2005) Proteins , vol.61 , pp. 127-136
    • Julie, D.T.1    Patrice, K.2    Raymond, R.3    Olivier, P.4
  • 39
    • 45949105543 scopus 로고    scopus 로고
    • Dialign-tx. greedy and progressive approaches for segment-based multiple sequence alignment
    • Amarendran R.S., Michael K., Burkhard M. Dialign-tx. greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms Mol. Biol. 2008, 3:6.
    • (2008) Algorithms Mol. Biol. , vol.3 , pp. 6
    • Amarendran, R.S.1    Michael, K.2    Burkhard, M.3
  • 40
    • 84859778326 scopus 로고    scopus 로고
    • High-quality sequence clustering guided by network topology and multiple alignment likelihood
    • Miele V., Penel S., Daubin V., Picard F., Kahn D., Duret L. High-quality sequence clustering guided by network topology and multiple alignment likelihood. Bioinformatics 2012, 28(8):1078-1085.
    • (2012) Bioinformatics , vol.28 , Issue.8 , pp. 1078-1085
    • Miele, V.1    Penel, S.2    Daubin, V.3    Picard, F.4    Kahn, D.5    Duret, L.6
  • 41
    • 80052722558 scopus 로고    scopus 로고
    • Seed. efficient clustering of next-generation sequences
    • Ergude B., Tao J., Isgouhi K., Thomas G. Seed. efficient clustering of next-generation sequences. Bioinformatics 2011, 27(18):2502-2509.
    • (2011) Bioinformatics , vol.27 , Issue.18 , pp. 2502-2509
    • Ergude, B.1    Tao, J.2    Isgouhi, K.3    Thomas, G.4
  • 42
    • 77958605377 scopus 로고    scopus 로고
    • Clustering metagenomic sequences with interpolated Markov models
    • David R.K., Steven L.S. Clustering metagenomic sequences with interpolated Markov models. BMC Bioinformatics 2010, 11:544-555.
    • (2010) BMC Bioinformatics , vol.11 , pp. 544-555
    • David, R.K.1    Steven, L.S.2
  • 43
    • 79951519599 scopus 로고    scopus 로고
    • Fast and accurate clustering of noncoding RNAs using ensembles of sequence alignments and secondary structures
    • Yutaka S., Kengo S., Yasubumi S. Fast and accurate clustering of noncoding RNAs using ensembles of sequence alignments and secondary structures. BMC Bioinformatics 2011, 12(Suppl 1):S48-S55.
    • (2011) BMC Bioinformatics , vol.12 , Issue.SUPPL 1
    • Yutaka, S.1    Kengo, S.2    Yasubumi, S.3
  • 44
    • 33751004142 scopus 로고    scopus 로고
    • Probalign. multiple sequence alignment using partition function posterior probabilities
    • Usman R., Dennis R.L. Probalign. multiple sequence alignment using partition function posterior probabilities. Bioinformatics 2006, 22:2715-2721.
    • (2006) Bioinformatics , vol.22 , pp. 2715-2721
    • Usman, R.1    Dennis, R.L.2
  • 45
    • 0037010180 scopus 로고    scopus 로고
    • Quality assessment of multiple alignment programs
    • Lassmann T., Sonnhammer E.L. Quality assessment of multiple alignment programs. FEBS Lett. 2002, 529:126-130.
    • (2002) FEBS Lett. , vol.529 , pp. 126-130
    • Lassmann, T.1    Sonnhammer, E.L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.