메뉴 건너뛰기




Volumn 5, Issue , 2004, Pages

DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors

Author keywords

[No Author keywords available]

Indexed keywords

LARGE GENOMIC SEQUENCES; MULTIPLE ALIGNMENT; MULTIPLE PROCESSORS; MULTIPLE SEQUENCE ALIGNMENTS; PARALLEL PROCESSOR; PARALLEL VERSION; SEQUENCE ALIGNMENTS; SEQUENCE PAIR;

EID: 13244259261     PISSN: 14712105     EISSN: None     Source Type: Journal    
DOI: 10.1186/1471-2105-5-128     Document Type: Article
Times cited : (33)

References (30)
  • 1
    • 0036208872 scopus 로고    scopus 로고
    • Recent progress in multiple sequence alignment: A survey
    • Notredame C: Recent progress in multiple sequence alignment: a survey. Pharmacogenomics 2002, 3:131-144.
    • (2002) Pharmacogenomics , vol.3 , pp. 131-144
    • Notredame, C.1
  • 2
    • 0037010180 scopus 로고    scopus 로고
    • Quality assessment of multiple alignment programs
    • Lassmann T, Sonnhammer EL: Quality assessment of multiple alignment programs. FEBS Letters 2002, 529:126-130.
    • (2002) FEBS Letters , vol.529 , pp. 126-130
    • Lassmann, T.1    Sonnhammer, E.L.2
  • 4
    • 0142056169 scopus 로고    scopus 로고
    • An applications-focused review of comparative genomics tools: Capabilities, limitations, and future challenges
    • Chain P, Kurtz S, Ohlebusch E, Slezak T: An applications-focused review of comparative genomics tools: capabilities, limitations, and future challenges. Briefings in Bioinformatics 2003, 4:105-123.
    • (2003) Briefings in Bioinformatics , vol.4 , pp. 105-123
    • Chain, P.1    Kurtz, S.2    Ohlebusch, E.3    Slezak, T.4
  • 5
    • 0035011227 scopus 로고    scopus 로고
    • Comparison of genomic DNA sequences: Solved and unsolved problems
    • Miller W: Comparison of genomic DNA sequences: solved and unsolved problems. Bioinformatics 2001, 17:391-397.
    • (2001) Bioinformatics , vol.17 , pp. 391-397
    • Miller, W.1
  • 7
    • 0242470267 scopus 로고    scopus 로고
    • Efficient multiple genome alignment
    • Hohl M, Kurtz S, Ohlebusch E: Efficient multiple genome alignment. Bioinformatics 2002, 18 Suppl 1:S312-S320.
    • (2002) Bioinformatics , vol.18 , Issue.SUPPL. 1
    • Hohl, M.1    Kurtz, S.2    Ohlebusch, E.3
  • 8
    • 0032945593 scopus 로고    scopus 로고
    • DIALIGN 2: Improvement of the segment-tosegment approach to multiple sequence alignment
    • Morgenstern B: DIALIGN 2: improvement of the segment-tosegment approach to multiple sequence alignment. Bioinformatics 1999, 15:211-218.
    • (1999) Bioinformatics , vol.15 , pp. 211-218
    • Morgenstern, B.1
  • 11
    • 0035154384 scopus 로고    scopus 로고
    • Long-range comparison of human and mouse SCL loci: Localized regions of sensitivity to restriction endonucleases correspond precisely with peaks of conserved noncoding sequences
    • Göttgens B, Gilbert J, Barton L, Grafham D, Rogers J, Bentley D, Green A: Long-range comparison of human and mouse SCL loci: localized regions of sensitivity to restriction endonucleases correspond precisely with peaks of conserved noncoding sequences. Genome Res 2001, 11:87-97.
    • (2001) Genome Res. , vol.11 , pp. 87-97
    • Göttgens, B.1    Gilbert, J.2    Barton, L.3    Grafham, D.4    Rogers, J.5    Bentley, D.6    Green, A.7
  • 13
    • 0038028675 scopus 로고    scopus 로고
    • Conserved noncoding sequences among cultivated cereal genomes identify candidate regulatory sequence elements and patterns of promoter evolution
    • Guo H, Moose SP: Conserved noncoding sequences among cultivated cereal genomes identify candidate regulatory sequence elements and patterns of promoter evolution. Plant Cell 2003, 15: 143-1158.
    • (2003) Plant Cell , vol.15 , pp. 1143-1158
    • Guo, H.1    Moose, S.P.2
  • 15
    • 1842679836 scopus 로고    scopus 로고
    • Surveying Phylogenetic Footprints in Large Gene Clusters: Applications to Hox Cluster Duplications
    • Prohaska S, Fried C, Flamm C, Wagner GP, Stadler PF: Surveying Phylogenetic Footprints in Large Gene Clusters: Applications to Hox Cluster Duplications. Mol Evol Phylog 2004, 31: 81-604.
    • (2004) Mol. Evol. Phylog. , vol.31 , pp. 581-604
    • Prohaska, S.1    Fried, C.2    Flamm, C.3    Wagner, G.P.4    Stadler, P.F.5
  • 16
    • 0344179079 scopus 로고    scopus 로고
    • Independent Hox-cluster duplications in lampreys
    • Fried C, Prohaska S, Stadler P: Independent Hox-cluster duplications in lampreys. J EXP ZOOL PART B 2003, 299B: 8-25.
    • (2003) J. EXP. ZOOL. PART B , vol.299 B , pp. 18-25
    • Fried, C.1    Prohaska, S.2    Stadler, P.3
  • 21
    • 0041386069 scopus 로고    scopus 로고
    • ClustalW-MPI: ClustalW analysis using distributed and parallel computing
    • Li KB: ClustalW-MPI: ClustalW analysis using distributed and parallel computing. Bioinformatics 2003, 19:1585-1586.
    • (2003) Bioinformatics , vol.19 , pp. 1585-1586
    • Li, K.B.1
  • 22
    • 31244432403 scopus 로고    scopus 로고
    • A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
    • Morgenstern B: A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences. Applied Mathematics Letters 2002, 15:11-16.
    • (2002) Applied Mathematics Letters , vol.15 , pp. 11-16
    • Morgenstern, B.1
  • 23
    • 23044525766 scopus 로고    scopus 로고
    • Speeding up the DIALIGN multiple alignment program by using the 'Greedy Alignment of BIOlogical Sequences LIBrary' (GABIOS-LIB)
    • Abdeddaïm S, Morgenstern B: Speeding up the DIALIGN multiple alignment program by using the 'Greedy Alignment of BIOlogical Sequences LIBrary' (GABIOS-LIB). Lecture Notes in Computer Science 2001, 2066:1-11.
    • (2001) Lecture Notes in Computer Science , vol.2066 , pp. 1-11
    • Abdeddaïm, S.1    Morgenstern, B.2
  • 25
    • 0345676554 scopus 로고    scopus 로고
    • Multiple sequence alignment with the divide-and-conquer method
    • Stoye J: Multiple sequence alignment with the divide-and-conquer method. Gene 1998, 211:GC45-GC56.
    • (1998) Gene , vol.211
    • Stoye, J.1
  • 26
    • 0016518550 scopus 로고
    • A linear space algorithm for computing maximal common subsequences
    • Hirschberg DS: A linear space algorithm for computing maximal common subsequences. Commun ACM 1975, 18:314-343.
    • (1975) Commun. ACM , vol.18 , pp. 314-343
    • Hirschberg, D.S.1
  • 27
    • 0343179415 scopus 로고
    • A Message-Passing Interface Standard
    • Message Passing Interface Forum: MPI Tech. Rep. CS-94-230, Computer Science Department, University of Tennessee, Knoxville, TN
    • Message Passing Interface Forum: MPI: A Message-Passing Interface Standard. Tech. Rep. CS-94-230, Computer Science Department, University of Tennessee, Knoxville, TN 1994.
    • (1994)
  • 28
    • 0010193437 scopus 로고    scopus 로고
    • Extensions to the Message-Passing Interface
    • Message Passing Interface Forum: MPI-2 Tech. rep., Computer Science Department, University of Tennessee, Knoxville, TN
    • Message Passing Interface Forum: MPI-2: Extensions to the Message-Passing Interface. Tech. rep., Computer Science Department, University of Tennessee, Knoxville, TN 1997.
    • (1997)
  • 29
    • 0033168097 scopus 로고    scopus 로고
    • A comprehensive comparison of protein sequence alignment programs
    • Thompson JD, Plewniak F, Poch O: A comprehensive comparison of protein sequence alignment programs. Nucleic Acids Research 1999, 27:2682-2690.
    • (1999) Nucleic Acids Research , vol.27 , pp. 2682-2690
    • Thompson, J.D.1    Plewniak, F.2    Poch, O.3
  • 30
    • 85060036181 scopus 로고
    • Validity of the single processor approach to achieve large-scale computing capabilities
    • AFIPS Conference Proceedings 30 AFIPS Press
    • Amdahl GM: Validity of the single processor approach to achieve large-scale computing capabilities. In AFIPS Conference Proceedings 30 AFIPS Press; 1967:483.
    • (1967) , pp. 483
    • Amdahl, G.M.1


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