메뉴 건너뛰기




Volumn 1448 LNCS, Issue , 1998, Pages 174-188

Fixed topology alignment with recombination

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT RATIO; FIXED TOPOLOGIES; INTERNAL NODES; MULTIPLE SEQUENCE ALIGNMENTS;

EID: 84877357552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (24)
  • 1
    • 0000773502 scopus 로고
    • Trees, stars, and multiple sequence afignment
    • S. Altschul and D. Lipman, Trees, stars, and multiple sequence afignment, SIAM Journal on Applied Math., 49 (1989), pp. 197-209.
    • (1989) SIAM Journal on Applied Math. , vol.49 , pp. 197-209
    • Altschul, S.1    Lipman, D.2
  • 4
    • 0024641218 scopus 로고
    • Speeding up dynamic programming with applications to molecular biology
    • Z. Galil and R. Ciancarlo, "Speeding up dynamic programming with applications to molecular biology", Theoretical Computer Science 64, pp. 107-118, 1989.
    • (1989) Theoretical Computer Science , vol.64 , pp. 107-118
    • Galil, Z.1    Ciancarlo, R.2
  • 6
    • 0024766957 scopus 로고
    • A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given
    • J. Hein, A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given, Mol. Biol. Evol. 6 (1989), 649-668.
    • (1989) Mol. Biol. Evol. , vol.6 , pp. 649-668
    • Hein, J.1
  • 7
    • 0025299784 scopus 로고
    • Reconstructing evolution of sequences subject to recombination using parsimony
    • J. Hein, Reconstructing evolution of sequences subject to recombination using parsimony, Math. Biosci. 98(1990), 185-200.
    • (1990) Math. Biosci. , vol.98 , pp. 185-200
    • Hein, J.1
  • 8
    • 0027471670 scopus 로고
    • A heuristic method to reconstruct the history of sequences subject to recombination
    • J. Hein, A heuristic method to reconstruct the history of sequences subject to recombination, J. Mol. Evo. 36(1993) 396-405.
    • (1993) J. Mol. Evo. , vol.36 , pp. 396-405
    • Hein, J.1
  • 11
    • 84877315482 scopus 로고
    • An algorithm for locating non-overlapping regions of maximum alignment score
    • S. K. Kannan and E. W. Myers, "An algorithm for locating non-overlapping regions of maximum alignment score", CPM93, pp. 74-86, 1993.
    • (1993) CPM93 , pp. 74-86
    • Kannan, S.K.1    Myers, E.W.2
  • 12
    • 0028317748 scopus 로고
    • Reconstructing a history of recombinations from a set of sequences
    • Arlington, Virginia, January
    • J. Kececioglu and D. Gusfietd, " Reconstructing a history of recombinations from a set of sequences", 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, pp. 471-480, January 1994
    • (1994) 5th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 471-480
    • Kececioglu, J.1    Gusfietd, D.2
  • 13
    • 34748868569 scopus 로고
    • An algorithm for approximate tandem repeats
    • G. M. Landau and J. P. Schmidt, "An algorithm for approximate tandem repeats, CPM'93, pp. 120-133, 1993.
    • (1993) CPM'93 , pp. 120-133
    • Landau, G.M.1    Schmidt, J.P.2
  • 14
    • 0016424695 scopus 로고
    • Minimal mutation trees of sequences
    • D. Sankoff, Minimal mutation trees of sequences, SIAM J. Applied Math. 28(1975), 35-42.
    • (1975) SIAM J. Applied Math. , vol.28 , pp. 35-42
    • Sankoff, D.1
  • 15
    • 0017293845 scopus 로고
    • Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA
    • D. Sankoff, R. J. Cedergren and G. Lapalme, Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA, J. Mol. Evol. 7(1976), 133-149.
    • (1976) J. Mol. Evol. , vol.7 , pp. 133-149
    • Sankoff, D.1    Cedergren, R.J.2    Lapalme, G.3
  • 17
    • 0023293718 scopus 로고
    • Genetic recombination
    • February
    • F. W. Stahl, "Genetic recombination", Scientific American, 90-101, February 1987.
    • (1987) Scientific American , pp. 90-101
    • Stahl, F.W.1
  • 18
    • 0001140522 scopus 로고
    • Phylogenetic reconstruction
    • Molecular Systemtics, D. Hillis and C. Moritz (eds) , Sunderland, MA
    • D. Swofford and G. Olson, Phylogenetic reconstruction, in Molecular Systemtics, D. Hillis and C. Moritz (eds), Sinauer Associates, Sunderland, MA, 1990.
    • (1990) Sinauer Associates
    • Swofford, D.1    Olson, G.2
  • 20
    • 0028679709 scopus 로고
    • On the complexity of multiple sequence alignment
    • L. Wang and T. Jiang, On the complexity of multiple sequence alignment, Journal of Computational Biology, 1(1994), 337-348.
    • (1994) Journal of Computational Biology , vol.1 , pp. 337-348
    • Wang, L.1    Jiang, T.2
  • 21
    • 0000880429 scopus 로고    scopus 로고
    • Approximation algorithms for tree alignment with a given phylogeny
    • L. Wang, T. Jiang and E. L. Lawler, Approximation algorithms for tree alignment with a given phylogeny, Algorithmica, 16(1996), 302-315.
    • (1996) Algorithmica , vol.16 , pp. 302-315
    • Wang, L.1    Jiang, T.2    Lawler, E.L.3
  • 22
    • 0000503180 scopus 로고    scopus 로고
    • Improved approximation algorithms for tree alignment
    • L. Wang and D. Gusfield, Improved approximation algorithms for tree alignment, Journal of Algorithms, vol. 25, pp. 255-173, 1997.
    • (1997) Journal of Algorithms , vol.25 , pp. 255-173
    • Wang, L.1    Gusfield, D.2


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