메뉴 건너뛰기




Volumn 32, Issue WEB SERVER ISS., 2004, Pages

DIALIGN: Multiple DNA and protein sequence alignment at BiBiServ

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

EID: 3242891684     PISSN: 03051048     EISSN: None     Source Type: Journal    
DOI: 10.1093/nar/gkh373     Document Type: Article
Times cited : (210)

References (22)
  • 1
    • 0036208872 scopus 로고    scopus 로고
    • Recent progress in multiple sequence alignment: A survey
    • Notredame,C. (2002) Recent progress in multiple sequence alignment: a survey. Pharmacogenomics, 3, 131-144.
    • (2002) Pharmacogenomics , vol.3 , pp. 131-144
    • Notredame, C.1
  • 2
    • 0029861894 scopus 로고    scopus 로고
    • Multiple DNA and protein sequence alignment based on segment-to-segment comparison
    • Morgenstern,B., Dress,A. and Werner,T. (1996) Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl Acad. Sci. USA, 93, 12098-12103.
    • (1996) Proc. Natl. Acad. Sci. USA. , vol.93 , pp. 12098-12103
    • Morgenstern, B.1    Dress, A.2    Werner, T.3
  • 3
    • 0032945593 scopus 로고    scopus 로고
    • DIALIGN 2: Improvement of the segment-to-segment approach to multiple sequence alignment
    • Morgenstern,B. (1999) DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15, 211-218.
    • (1999) Bioinformatics , vol.15 , pp. 211-218
    • Morgenstern, B.1
  • 4
    • 0032988850 scopus 로고    scopus 로고
    • BAliBASE: A benchmark alignment database for the evaluation of multiple sequence alignment programs
    • Thompson,J.D., Plewniak,F. and Poch,O. (1999) BAliBASE: a benchmark alignment database for the evaluation of multiple sequence alignment programs. Bioinformatics, 15, 87-88.
    • (1999) Bioinformatics , vol.15 , pp. 87-88
    • Thompson, J.D.1    Plewniak, F.2    Poch, O.3
  • 5
    • 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. and Gibson,T.J. (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res., 22, 4673-4680.
    • (1994) Nucleic Acids Res. , vol.22 , pp. 4673-4680
    • Thompson, J.D.1    Higgins, D.G.2    Gibson, T.J.3
  • 6
    • 0033168097 scopus 로고    scopus 로고
    • A comprehensive comparison of protein sequence alignment programs
    • Thompson,J.D., Plewniak,F. and Poch,O. (1999) A comprehensive comparison of protein sequence alignment programs. Nucleic Acids Res., 27, 2682-2690.
    • (1999) Nucleic Acids Res. , vol.27 , pp. 2682-2690
    • Thompson, J.D.1    Plewniak, F.2    Poch, O.3
  • 7
    • 0034623005 scopus 로고    scopus 로고
    • T-COFFEE: A novel algorithm for multiple sequence alignment
    • Notredame,C., Higgins,D. and Heringa,J. (2000) T-COFFEE: a novel algorithm for multiple sequence alignment. J. Mol. Biol., 302, 205-217.
    • (2000) J. Mol. Biol. , vol.302 , pp. 205-217
    • Notredame, C.1    Higgins, D.2    Heringa, J.3
  • 8
    • 0037010180 scopus 로고    scopus 로고
    • Quality assessment of multiple alignment programs
    • Lassmann,T. and Sonnhammer,E.L. (2002) Quality assessment of multiple alignment programs. FEBS Lett., 529, 126-130.
    • (2002) FEBS Lett. , vol.529 , pp. 126-130
    • Lassmann, T.1    Sonnhammer, E.L.2
  • 9
    • 0036203448 scopus 로고    scopus 로고
    • Multiple sequence alignment using partial order graphs
    • Lee,C., Grasso,C. and Sharlow,M.F. (2002) Multiple sequence alignment using partial order graphs. Bioinformatics, 18, 452-464.
    • (2002) Bioinformatics , vol.18 , pp. 452-464
    • Lee, C.1    Grasso, C.2    Sharlow, M.F.3
  • 10
    • 21744437040 scopus 로고    scopus 로고
    • Incremental computation of transitive closure and greedy alignment
    • Proceedings of the Eigth Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science. Vol. Springer Verlag, Heidelberg
    • Abdeddaim,S. (1997) Incremental computation of transitive closure and greedy alignment. Proceedings of the Eigth Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science. Vol. 1264, Springer Verlag, Heidelberg, pp. 167-179.
    • (1997) , vol.1264 , pp. 167-179
    • Abdeddaim, S.1
  • 11
    • 0031604259 scopus 로고    scopus 로고
    • Segment-based scores for pairwise and multiple sequence alignments
    • Glasgow,J., Littlejohn,T., Major,F., Lathrop,R., Sankoff,D. and Sensen,C. eds, Proceedings of the Sixth International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Parc, CA, pp
    • Morgenstern,B., Hahn,K., Atchley,W.R. and Dress,A.W.M. (1998) Segment-based scores for pairwise and multiple sequence alignments. In Glasgow,J., Littlejohn,T., Major,F., Lathrop,R., Sankoff,D. and Sensen,C. (eds), Proceedings of the Sixth International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Parc, CA, pp. 115-121.
    • (1998) , pp. 115-121
    • Morgenstern, B.1    Hahn, K.2    Atchley, W.R.3    Dress, A.W.M.4
  • 12
    • 23044525766 scopus 로고    scopus 로고
    • Speeding up the DIALIGN multiple alignment program by using the 'greedy alignment of biological sequences library' (GABIOS-LIB)
    • Abdeddaim,S. and Morgenstern,B. (2001) Speeding up the DIALIGN multiple alignment program by using the 'greedy alignment of biological sequences library' (GABIOS-LIB). Lecture Notes in Comput. Sci., 2066, 1-11.
    • (2001) Lecture Notes in Comput. Sci. , vol.2066 , pp. 1-11
    • Abdeddaim, S.1    Morgenstern, B.2
  • 15
    • 0032892093 scopus 로고    scopus 로고
    • An exact solution for the segment-to-segment multiple sequence alignment problem
    • Lenhof,H.-P., Morgenstern,B. and Reinert,K. (1999) An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinformatics, 15, 203-210.
    • (1999) Bioinformatics , vol.15 , pp. 203-210
    • Lenhof, H.-P.1    Morgenstern, B.2    Reinert, K.3
  • 16
    • 3242877699 scopus 로고    scopus 로고
    • Divide-and-conquer alignment with segment-based constraints
    • Sammeth,M., Morgenstern,B. and Stoye,J. (2003) Divide-and-conquer alignment with segment-based constraints. Bioinformatics, 19, ii189-ii195.
    • (2003) Bioinformatics , vol.19
    • Sammeth, M.1    Morgenstern, B.2    Stoye, J.3
  • 18
    • 0037433035 scopus 로고    scopus 로고
    • AltAVisT: A WWW server for comparison of alternative multiple sequence alignments
    • Morgenstern,B., Goel,S., Sczyrba,A. and Dress,A. (2003) AltAVisT: a WWW server for comparison of alternative multiple sequence alignments. Bioinformatics, 19, 425-426.
    • (2003) Bioinformatics , vol.19 , pp. 425-426
    • Morgenstern, B.1    Goel, S.2    Sczyrba, A.3    Dress, A.4
  • 19
    • 0035011227 scopus 로고    scopus 로고
    • Comparison of genomic DNA sequences: Solved and unsolved problems
    • Miller,W. (2001) Comparison of genomic DNA sequences: solved and unsolved problems. Bioinformatics, 17, 391-397.
    • (2001) Bioinformatics , vol.17 , pp. 391-397
    • Miller, W.1
  • 20
    • 0142056169 scopus 로고    scopus 로고
    • An applications-focused review of comparative genomics tools: Capabilities, limitations, and future challenges
    • Chain,P., Kurtz,S., Ohlebusch,E. and Slezak,T. (2003) An applications-focused review of comparative genomics tools: capabilities, limitations, and future challenges. Brief. Bioinform., 4, 105-123.
    • (2003) Brief. Bioinform. , vol.4 , pp. 105-123
    • Chain, P.1    Kurtz, S.2    Ohlebusch, E.3    Slezak, T.4
  • 22
    • 3242889413 scopus 로고    scopus 로고
    • The CHAOS/DIALIGN WWW server for multiple alignment of genomic sequences
    • Brudno,M., Steinkamp,R. and Morgenstern,B. (2004) The CHAOS/DIALIGN WWW server for multiple alignment of genomic sequences. Nucleic Acids Res., 32, W41-W44.
    • (2004) Nucleic Acids Res. , vol.32
    • Brudno, M.1    Steinkamp, R.2    Morgenstern, B.3


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