메뉴 건너뛰기




Volumn 26, Issue 5, 2010, Pages 453-455

A problem in POY tree searches (and its work-around) when some sequences are observed to be absent in some terminals

Author keywords

[No Author keywords available]

Indexed keywords


EID: 77956397753     PISSN: 07483007     EISSN: 10960031     Source Type: Journal    
DOI: 10.1111/j.1096-0031.2010.00306.x     Document Type: Letter
Times cited : (6)

References (11)
  • 1
    • 67650738926 scopus 로고    scopus 로고
    • An application of dynamic homology to morphological characters: direct optimization of setae sequences and phylogeny of the family Odontellidae (Poduromorpha, Collembola)
    • Agolin M, D'Haese CA. An application of dynamic homology to morphological characters: direct optimization of setae sequences and phylogeny of the family Odontellidae (Poduromorpha, Collembola). Cladistics 2009, 25:353-385.
    • (2009) Cladistics , vol.25 , pp. 353-385
    • Agolin, M.1    D'Haese, C.A.2
  • 2
    • 17444363410 scopus 로고    scopus 로고
    • Parsimony and the problem of inapplicables in sequence data
    • Albert VA. Ed, Oxford University Press, Oxford
    • De Laet JE. Parsimony and the problem of inapplicables in sequence data. Parsimony, Phylogeny, and Genomics 2005, 81-116. Albert VA. Ed, Oxford University Press, Oxford, pp
    • (2005) Parsimony, Phylogeny, and Genomics , pp. 81-116
    • De Laet, J.E.1
  • 3
    • 45749124657 scopus 로고    scopus 로고
    • TNT, a free program for phylogenetic analysis
    • Goloboff PA, Farris JS, Nixon KC. TNT, a free program for phylogenetic analysis. Cladistics 2008, 24:774-786.
    • (2008) Cladistics , vol.24 , pp. 774-786
    • Goloboff, P.A.1    Farris, J.S.2    Nixon, K.C.3
  • 4
    • 0016424695 scopus 로고
    • Minimal mutation trees of sequences
    • Sankoff D. Minimal mutation trees of sequences. SIAM J. Appl. Math. 1975, 28:35-42.
    • (1975) SIAM J. Appl. Math. , vol.28 , pp. 35-42
    • Sankoff, D.1
  • 6
    • 0030795485 scopus 로고    scopus 로고
    • The deferred path heuristic for the generalized tree alignment problem
    • Schwikowski B, Vingron M. The deferred path heuristic for the generalized tree alignment problem. J. Comput. Biol. 1997, 4:415-431.
    • (1997) J. Comput. Biol. , vol.4 , pp. 415-431
    • Schwikowski, B.1    Vingron, M.2
  • 8
    • 73649145874 scopus 로고    scopus 로고
    • POY version 4: phylogenetic analysis using dynamic homologies
    • Varón A, Vinh LS, Wheeler WC. POY version 4: phylogenetic analysis using dynamic homologies. Cladistics 2010, 26:72-85.
    • (2010) Cladistics , vol.26 , pp. 72-85
    • Varón, A.1    Vinh, L.S.2    Wheeler, W.C.3
  • 9
    • 0001857390 scopus 로고    scopus 로고
    • Optimization alignment: the end of multiple sequence alignment in phylogenetics?
    • Wheeler W. Optimization alignment: the end of multiple sequence alignment in phylogenetics? Cladistics 1996, 12:1-9.
    • (1996) Cladistics , vol.12 , pp. 1-9
    • Wheeler, W.1
  • 10
    • 0033505348 scopus 로고    scopus 로고
    • Fixed character states and the optimization of molecular sequence data
    • Wheeler W. Fixed character states and the optimization of molecular sequence data. Cladistics 1999, 15:379-385.
    • (1999) Cladistics , vol.15 , pp. 379-385
    • Wheeler, W.1


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