메뉴 건너뛰기




Volumn 5, Issue 1, 2001, Pages 95-115

A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks

Author keywords

Block chaining; Conserved blocks; Multiple sequence alignment

Indexed keywords


EID: 0043285300     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009841718561     Document Type: Article
Times cited : (8)

References (25)
  • 2
    • 0023571979 scopus 로고
    • Evaluation and improvements in automatic alignment of protein sequences
    • G.J. Barton and M.J.E. Sternberg, "Evaluation and improvements in automatic alignment of protein sequences," Protein Eng., vol. 1, pp. 89-94, 1987a.
    • (1987) Protein Eng. , vol.1 , pp. 89-94
    • Barton, G.J.1    Sternberg, M.J.E.2
  • 3
    • 0023518540 scopus 로고
    • A strategy for the rapid multiple alignment of protein sequences confidence levels from tertiary structure comparisons
    • G.J. Barton and M J.E. Sternberg, "A strategy for the rapid multiple alignment of protein sequences confidence levels from tertiary structure comparisons," J. Mol. Biol., vol. 198, pp. 327-337, 1987b.
    • (1987) J. Mol. Biol. , vol.198 , pp. 327-337
    • Barton, G.J.1    Sternberg, M.J.E.2
  • 4
    • 0026822891 scopus 로고
    • Analysis of conserved domains and sequence motifs in cellular regulatory proteins and locus control regions using new software tools for multiple alignment and visualization
    • M. Boguski, R.C. Hardison, S. Schwarts, and W. Miller, "Analysis of conserved domains and sequence motifs in cellular regulatory proteins and locus control regions using new software tools for multiple alignment and visualization," The New Biologist, vol. 4, pp. 247-260, 1992.
    • (1992) The New Biologist , vol.4 , pp. 247-260
    • Boguski, M.1    Hardison, R.C.2    Schwarts, S.3    Miller, W.4
  • 6
    • 0029184821 scopus 로고
    • Linear-space algorithms that build local alignments from fragments
    • K.-M. Chao and W. Miller, "Linear-space algorithms that build local alignments from fragments," Algorithmica, vol. 13, pp. 106-134, 1995.
    • (1995) Algorithmica , vol.13 , pp. 106-134
    • Chao, K.-M.1    Miller, W.2
  • 9
    • 0026886016 scopus 로고
    • Sparse dynamic programming. II: Convex and concave cost functions
    • D. Eppstein, Z. Galil, R. Giancarlo, and G.F. Italiano, "Sparse dynamic programming. II: convex and concave cost functions," J. Assoc. Comput. Mach., vol. 39, pp. 546-567, 1992b.
    • (1992) J. Assoc. Comput. Mach. , vol.39 , pp. 546-567
    • Eppstein, D.1    Galil, Z.2    Giancarlo, R.3    Italiano, G.F.4
  • 10
    • 0023084055 scopus 로고
    • Progressive sequence alignment as a prerequisite to correct phylogenetic trees
    • D.E. Feng and R.F. Doolittle, "Progressive sequence alignment as a prerequisite to correct phylogenetic trees," J. Mol. Evol., vol. 25, pp. 351-360, 1987.
    • (1987) J. Mol. Evol. , vol.25 , pp. 351-360
    • Feng, D.E.1    Doolittle, R.F.2
  • 11
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • D.S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. System Sci., vol. 7, pp. 256-278, 1974.
    • (1974) J. Comput. System Sci. , vol.7 , pp. 256-278
    • Johnson, D.S.1
  • 13
    • 84976657294 scopus 로고
    • The complexity of some problems on subsequences and supersequences
    • D. Maier, "The complexity of some problems on subsequences and supersequences," J. ACM, pp. 322-336, 1978.
    • (1978) J. ACM , pp. 322-336
    • Maier, D.1
  • 14
    • 0028341506 scopus 로고
    • Comparative analysis of multiple protein-sequence alignment methods
    • M.A. McClure, T.K. Vasi, and W.M. Fitch, "Comparative analysis of multiple protein-sequence alignment methods," Mol. Biol. Evol., vol. 11, no. 4, pp. 571-592, 1994.
    • (1994) Mol. Biol. Evol. , vol.11 , Issue.4 , pp. 571-592
    • McClure, M.A.1    Vasi, T.K.2    Fitch, W.M.3
  • 15
    • 0027157846 scopus 로고
    • Building multiple alignments from pairwise alignments
    • W. Miller, "Building multiple alignments from pairwise alignments," CABIOS, vol. 9, pp. 169-176, 1993.
    • (1993) CABIOS , vol.9 , pp. 169-176
    • Miller, W.1
  • 17
    • 0029861894 scopus 로고    scopus 로고
    • Multiple DNA and protein sequence alignment based on segment-to-segment comparison
    • B. Morgenstern, A. Dress, and T. Werner, "Multiple DNA and protein sequence alignment based on segment-to-segment comparison," Proc. Nat. Acad. Sci. USA, vol. 93, pp. 12098-12103, 1996.
    • (1996) Proc. Nat. Acad. Sci. USA , vol.93 , pp. 12098-12103
    • Morgenstern, B.1    Dress, A.2    Werner, T.3
  • 18
    • 0000050663 scopus 로고    scopus 로고
    • An approximation algorithm for alignment of multiple sequences using motif discovery
    • L. Parida, A. Floratos, and I. Rigoutsos, "An approximation algorithm for alignment of multiple sequences using motif discovery," J. Combinatorial Optimization, vol. 20, no. 7, 1999.
    • (1999) J. Combinatorial Optimization , vol.20 , Issue.7
    • Parida, L.1    Floratos, A.2    Rigoutsos, I.3
  • 19
    • 0023045778 scopus 로고
    • A multiple sequence alignment program
    • E. Sobel and H.M. Martinez, "A multiple sequence alignment program," Nucl. Acids Res., vol. 14, no. 1, pp. 363-374, 1986.
    • (1986) Nucl. Acids Res. , vol.14 , Issue.1 , pp. 363-374
    • Sobel, E.1    Martinez, H.M.2
  • 20
    • 0027968068 scopus 로고
    • CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice
    • J. Thompson, D. Higgins, and T. Gibson, "CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice," Necleic Acids Res., vol. 22, pp. 4673-4680, 1994.
    • (1994) Necleic Acids Res. , vol.22 , pp. 4673-4680
    • Thompson, J.1    Higgins, D.2    Gibson, T.3
  • 21
    • 0001228780 scopus 로고
    • A new algorithm for generating all the maximal independent sets
    • S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa, "A new algorithm for generating all the maximal independent sets," SIAM J. Comput., vol. 6, pp. 505-517, 1977.
    • (1977) SIAM J. Comput. , vol.6 , pp. 505-517
    • Tsukiyama, S.1    Ide, M.2    Ariyoshi, H.3    Shirakawa, I.4
  • 22
    • 0028679709 scopus 로고
    • On the complexity of multiple sequence alignment
    • L. Wang and T. Jiang, "On the complexity of multiple sequence alignment," J. Computat. Biol., vol. 1, no. 4, pp. 337-348, 1994.
    • (1994) J. Computat. Biol. , vol.1 , Issue.4 , pp. 337-348
    • Wang, L.1    Jiang, T.2
  • 23
    • 0025343113 scopus 로고
    • Consensus methods for DNA and protein sequence alignment
    • M.S. Waterman and R. Jones, "Consensus methods for DNA and protein sequence alignment," Methods in Enzymology, vol. 183, pp. 221-237, 1990.
    • (1990) Methods in Enzymology , vol.183 , pp. 221-237
    • Waterman, M.S.1    Jones, R.2
  • 24
    • 0006915882 scopus 로고    scopus 로고
    • Local multiple alignment via subgraph enumeration
    • Z. Zhang, B. He, and W Miller, "Local multiple alignment via subgraph enumeration," Discreet Appl. Math., vol. 71, pp. 337-365, 1996.
    • (1996) Discreet Appl. Math. , vol.71 , pp. 337-365
    • Zhang, Z.1    He, B.2    Miller, W.3


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