메뉴 건너뛰기




Volumn 1848, Issue , 2000, Pages 69-83

Parametric multiple sequence alignment and phylogeny construction

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY;

EID: 84868003442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_8     Document Type: Conference Paper
Times cited : (6)

References (36)
  • 2
    • 0024964655 scopus 로고
    • Gap costs for multiple sequence alignment
    • Stephen F. Altschul. Gap costs for multiple sequence alignment. J. Theor. Biol., 138:297-309, 1989.
    • (1989) J. Theor. Biol. , vol.138 , pp. 297-309
    • Altschul, S.F.1
  • 3
    • 10644220029 scopus 로고
    • Leaf pairs and tree dissections
    • Stephen F. Altschul. Leaf pairs and tree dissections. SIAM J. Disc. Math., 2(3):293-299, 1989.
    • (1989) SIAM J. Disc. Math. , vol.2 , Issue.3 , pp. 293-299
    • Altschul, S.F.1
  • 4
    • 0024974791 scopus 로고
    • Weights for data related by a tree
    • Stephen F. Altschul, Raymond J. Carrol, and David J. Lipman. Weights for data related by a tree. J. Mol. Biol., 207:647-653, 1989.
    • (1989) J. Mol. Biol. , vol.207 , pp. 647-653
    • Altschul, S.F.1    Carrol, R.J.2    Lipman, D.J.3
  • 5
    • 0000773502 scopus 로고
    • Trees, stars, and multiple biological sequence alignment
    • Stephen F. Altschul and David J. Lipman. Trees, stars, and multiple biological sequence alignment. SIAM J. Appl. Math., 49(1):197-209, 1989.
    • (1989) SIAM J. Appl. Math. , vol.49 , Issue.1 , pp. 197-209
    • Altschul, S.F.1    Lipman, D.J.2
  • 8
    • 84937412419 scopus 로고
    • n Cox and Wilfong, editors, Autonomous Robot Vehicles, Springer-Verlag
    • David Dobkin, Herbert Edelsbrunner, and C. K. Yap. Probing convex polytopes. In Cox and Wilfong, editors, Autonomous Robot Vehicles, pages 328-341. Springer-Verlag, 1990.
    • (1990) Probing Convex Polytopes , pp. 328-341
    • Dobkin, D.1    Edelsbrunner, H.2    Yap, C.K.3
  • 10
    • 0017014095 scopus 로고
    • Mathematical techniques for efficient record segmentation in large shared databases
    • M.J. Eisner and D.G. Severance. Mathematical techniques for efficient record segmentation in large shared databases. J. Assoc. Comput. Mach., 23:619-635, 1976.
    • (1976) J. Assoc. Comput. Mach , vol.23 , pp. 619-635
    • Eisner, M.J.1    Severance, D.G.2
  • 12
    • 0023084055 scopus 로고
    • Progressive alignment as a prerequisite to correct phylogenetic trees
    • D. Feng and R.F. Doolittle. Progressive alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol., 25:351-360, 1987.
    • (1987) J. Mol. Evol. , vol.25 , pp. 351-360
    • Feng, D.1    Doolittle, R.F.2
  • 14
    • 0342729285 scopus 로고
    • Constructing the minimization diagram of a two-parameter problem
    • David Fernández-Baca and S. Srinivasan. Constructing the minimization diagram of a two-parameter problem. Operations Research Letters, 10:87-93, 1991.
    • (1991) Operations Research Letters , vol.10 , pp. 87-93
    • Fernández-Baca, D.1    Srinivasan, S.2
  • 15
    • 0029366816 scopus 로고
    • Improving the practical space and time eficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment
    • S. K. Gupta, J. Kececioglu, and A. A. Schäffer. Improving the practical space and time eficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. Journal of Computational Biology, 2:459-472, 1995.
    • (1995) Journal of Computational Biology , vol.2 , pp. 459-472
    • Gupta, S.K.1    Kececioglu, J.2    Schäffer, A.A.3
  • 16
    • 0004062232 scopus 로고
    • Sensitivity analysis for combinatorial optimization
    • University of California, Berkeley, May
    • Dan Gusfield. Sensitivity analysis for combinatorial optimization. Technical Report UCB/ERL M80/22, University of California, Berkeley, May 1980.
    • (1980) Technical Report UCB/ERL M80/22
    • Gusfield, D.1
  • 17
    • 0020780619 scopus 로고
    • Parametric combinatorial computing and a problem in program module allocation
    • Dan Gusfield. Parametric combinatorial computing and a problem in program module allocation. J. Assoc. Comput. Mach., 30(3):551-563, 1983.
    • (1983) J. Assoc. Comput. Mach. , vol.30 , Issue.3 , pp. 551-563
    • Gusfield, D.1
  • 18
    • 0027351056 scopus 로고
    • Eficient algorithms for multiple sequence alignment with guaranteed error bounds
    • Dan Gusfield. Eficient algorithms for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol., 55:141-154, 1993.
    • (1993) Bull. Math. Biol. , vol.55 , pp. 141-154
    • Gusfield, D.1
  • 20
    • 0028517367 scopus 로고
    • Parametric optimization of sequence alignment
    • Dan Gusfield, K. Balasubramanian, and Dalit Naor. Parametric optimization of sequence alignment. Algorithmica, 12:312-326, 1994.
    • (1994) Algorithmica , vol.12 , pp. 312-326
    • Gusfield, D.1    Balasubramanian, K.2    Naor, D.3
  • 23
    • 0026458378 scopus 로고
    • Amino acid substitution matrices from protein blocks
    • S. Henikoff and J.G. Henikoff. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. USA, 89:10915-10919, 1992.
    • (1992) Proc. Natl. Acad. Sci. USA , vol.89 , pp. 10915-10919
    • Henikoff, S.1    Henikoff, J.G.2
  • 25
    • 0028679709 scopus 로고
    • On the complexity of multiple sequence alignment
    • T. Jiang and L. Wang. On the complexity of multiple sequence alignment. Journal of Computational Biology, 1:337-348, 1994.
    • (1994) Journal of Computational Biology , vol.1 , pp. 337-348
    • Jiang, T.1    Wang, L.2
  • 26
    • 0027961628 scopus 로고
    • Aligning sequences via an evolutionary tree: Complexity and approximation (extended abstract)
    • Tao Jiang, Eugene L. Lawler, and Lusheng Wang. Aligning sequences via an evolutionary tree: Complexity and approximation (extended abstract). In Proc. 26th Ann. Symp. Theory of Computing, pages 760-769, 1994.
    • (1994) Proc. 26Th Ann. Symp. Theory of Computing , pp. 760-769
    • Jiang, T.1    Lawler, E.L.2    Wang, L.3
  • 30
    • 0016424695 scopus 로고
    • Minimal mutation trees of sequences
    • David Sankoff. Minimal mutation trees of sequences. SIAM J. Appl. Math., 28(1):35-42, January 1975.
    • (1975) SIAM J. Appl. Math. , vol.28 , Issue.1 , pp. 35-42
    • Sankoff, D.1
  • 32
    • 0030740946 scopus 로고    scopus 로고
    • New flexible approaches for multiple sequence alignment
    • Tetsuo Shibuya and Hiroshi Imai. New flexible approaches for multiple sequence alignment. Journal of Computational Biology, 4(3):385-413, 1997.
    • (1997) Journal of Computational Biology , vol.4 , Issue.3 , pp. 385-413
    • Shibuya, T.1    Imai, H.2
  • 34
    • 0028047892 scopus 로고
    • Sequence alignment and penalty choice: Review of concepts, case studies, and implications
    • Martin Vingron and Michael S.Waterman. Sequence alignment and penalty choice: Review of concepts, case studies, and implications. J. Mol. Biol., 235:1-12, 1994.
    • (1994) J. Mol. Biol. , vol.235 , pp. 1-12
    • Vingron, M.1    Michael, S.2
  • 36
    • 0028878618 scopus 로고
    • Sequence alignment, parameter sensitivity, and the phylogenetic analysis of molecular data
    • Ward C. Wheeler. Sequence alignment, parameter sensitivity, and the phylogenetic analysis of molecular data. Syst. Bio., 44(3):321-331, 1995.
    • (1995) Syst. Bio. , vol.44 , Issue.3 , pp. 321-331
    • Wheeler, W.C.1


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