메뉴 건너뛰기




Volumn 15, Issue 3, 1999, Pages 203-210

An exact solution for the segment-to-segment multiple sequence alignment problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; CHEMICAL STRUCTURE; CONFERENCE PAPER; EVOLUTION; GENETIC PROCEDURES; MOLECULAR BIOLOGY; PRIORITY JOURNAL;

EID: 0032892093     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/15.3.203     Document Type: Conference Paper
Times cited : (30)

References (22)
  • 1
    • 21744437040 scopus 로고    scopus 로고
    • Incremental computation of transitive closure, and greedy alignment
    • No. 1264 in LNCS. Springer, Berlin
    • Abdeddaïm,S. (1997) Incremental computation of transitive closure, and greedy alignment. In Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching. No. 1264 in LNCS. Springer, Berlin, pp. 167-179.
    • (1997) Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching , pp. 167-179
    • Abdeddaïm, S.1
  • 2
    • 0022885515 scopus 로고
    • Locally optimal subalignments using nonlinear similarity functions
    • Altschul, S. and Erickson, B. (1986) Locally optimal subalignments using nonlinear similarity functions. Bull. Math. Biol., 48, 633-660.
    • (1986) Bull. Math. Biol. , vol.48 , pp. 633-660
    • Altschul, S.1    Erickson, B.2
  • 4
    • 0022474446 scopus 로고
    • Maximum likelihood alignment of DNA sequences
    • Bishop, M. and Thompson, E. (1986) Maximum likelihood alignment of DNA sequences. J. Mol. Biol., 190, 159-165.
    • (1986) J. Mol. Biol. , vol.190 , pp. 159-165
    • Bishop, M.1    Thompson, E.2
  • 5
    • 0032512801 scopus 로고    scopus 로고
    • A symmetric-iterated multiple alignment of protein sequences
    • Brocchieri, L. and Karlin, S. (1998) A symmetric-iterated multiple alignment of protein sequences. J. Mol. Biol., 276, 249-264.
    • (1998) J. Mol. Biol. , vol.276 , pp. 249-264
    • Brocchieri, L.1    Karlin, S.2
  • 6
    • 4243258421 scopus 로고    scopus 로고
    • The design of the branch and cut system ABACUS
    • Institut für Informatik, University of Cologne
    • Jünger, M. and Thienel, S. (1997) The design of the branch and cut system ABACUS. Technical Report No. 97.260, Institut für Informatik, University of Cologne.
    • (1997) Technical Report No. 97.260
    • Jünger, M.1    Thienel, S.2
  • 8
    • 85010105210 scopus 로고
    • The maximum weight trace problem in multiple sequence alignment
    • No. 684 in LNCS, Springer. Berlin
    • Kececioglu, J. (1993) The maximum weight trace problem in multiple sequence alignment. In Proceedings of the 4th Symposium on Combinatorial Pattern Matching. No. 684 in LNCS, Springer. Berlin, pp. 106-119.
    • (1993) Proceedings of the 4th Symposium on Combinatorial Pattern Matching , pp. 106-119
    • Kececioglu, J.1
  • 9
    • 0027912333 scopus 로고
    • Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment
    • Lawrence, C., Altschul, S., Boguski, M., Liu, J., Neuwald, A. and Wootton, J. (1993) Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science, 262, 208-213.
    • (1993) Science , vol.262 , pp. 208-213
    • Lawrence, C.1    Altschul, S.2    Boguski, M.3    Liu, J.4    Neuwald, A.5    Wootton, J.6
  • 10
    • 0028341506 scopus 로고
    • Comparative analysis of multiple protein-sequence alignment methods
    • McClure, M., Vasi, T.K. and Fitch, W.M. (1994) Comparative analysis of multiple protein-sequence alignment methods. Mol. Biol. Evol., 4, 571-592.
    • (1994) Mol. Biol. Evol. , vol.4 , pp. 571-592
    • McClure, M.1    Vasi, T.K.2    Fitch, W.M.3
  • 11
    • 0029184961 scopus 로고
    • LEDA, a platform for combinatorial and geometric computing
    • Mehlhorn, K. and Näher, S. (1995) LEDA, a platform for combinatorial and geometric computing. Commun. ACM, 38, 96-102.
    • (1995) Commun. ACM , vol.38 , pp. 96-102
    • Mehlhorn, K.1    Näher, S.2
  • 12
    • 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
  • 13
    • 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
  • 15
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino-acid sequence of two proteins
    • Needleman, S. and Wunsch, C. (1970) A general method applicable to the search for similarities in the amino-acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
    • (1970) J. Mol. Biol. , vol.48 , pp. 443-453
    • Needleman, S.1    Wunsch, C.2
  • 16
    • 0023989064 scopus 로고
    • Improved tools for biological sequence comparison
    • Pearson, W. and Lipman, D. (1988) Improved tools for biological sequence comparison. Proc. Natl Acad. Sci. USA, 85, 2444-2448.
    • (1988) Proc. Natl Acad. Sci. USA , vol.85 , pp. 2444-2448
    • Pearson, W.1    Lipman, D.2
  • 18
    • 0026100921 scopus 로고
    • A workbench for multiple alignment construction and analysis
    • Schuler, G., Altschul, S. and Lipman, D. (1991) A workbench for multiple alignment construction and analysis. Proteins, 9, 180-190.
    • (1991) Proteins , vol.9 , pp. 180-190
    • Schuler, G.1    Altschul, S.2    Lipman, D.3
  • 19
    • 40849099796 scopus 로고
    • Comparison of biosequences
    • Smith, T. and Waterman, M. (1981) Comparison of biosequences. Adv. Appl. Math., 2, 482-489.
    • (1981) Adv. Appl. Math. , vol.2 , pp. 482-489
    • Smith, T.1    Waterman, M.2
  • 20
    • 0026528734 scopus 로고
    • Inching toward reality: An improved likelihood model of sequence evolution
    • Thorne, J., Kishino, H. and Felsenstein, J. (1992) Inching toward reality: An improved likelihood model of sequence evolution. J. Mol. Evol., 34, 3-16.
    • (1992) J. Mol. Evol. , vol.34 , pp. 3-16
    • Thorne, J.1    Kishino, H.2    Felsenstein, J.3
  • 21
    • 0026036377 scopus 로고
    • Motif recognition and alignment for many sequences by comparison of dot-matrices
    • Vingron, M. and Argos, P. (1991) Motif recognition and alignment for many sequences by comparison of dot-matrices. J. Mol. Biol., 218, 33-43.
    • (1991) J. Mol. Biol. , vol.218 , pp. 33-43
    • Vingron, M.1    Argos, P.2
  • 22
    • 0009603933 scopus 로고
    • Multiple sequence comparison and consistency on multipartite graphs
    • Vingron, M. and Pevzner, P. (1995) Multiple sequence comparison and consistency on multipartite graphs. Adv. Appl. Math., 16, 1-22.
    • (1995) Adv. Appl. Math. , vol.16 , pp. 1-22
    • Vingron, M.1    Pevzner, P.2


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