메뉴 건너뛰기




Volumn 10, Issue 1, 2013, Pages 18-25

A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees

Author keywords

fixed parameter tractability; nonbinary; Phylogenetic network

Indexed keywords

COMBINATORIAL STRUCTURES; FIXED-PARAMETER TRACTABILITY; FIXED-PARAMETER TRACTABLE ALGORITHMS; MAXIMAL ELEMENTS; NON-BINARY; PARTIAL ORDER; PHYLOGENETIC NETWORKS; PHYLOGENETIC TREES;

EID: 84878308660     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2012.134     Document Type: Article
Times cited : (17)

References (29)
  • 1
    • 84856082446 scopus 로고    scopus 로고
    • Fast computation of minimum hybridization networks
    • B. Albrecht, C. Scornavacca, A. Cenci, and D.H. Huson, "Fast Computation of Minimum Hybridization Networks," Bioinfor-matics, vol. 28, no. 2, pp. 191-197, 2012.
    • (2012) Bioinfor-matics , vol.28 , Issue.2 , pp. 191-197
    • Albrecht, B.1    Scornavacca, C.2    Cenci, A.3    Huson, D.H.4
  • 2
    • 22844448185 scopus 로고    scopus 로고
    • Bounding the number of hybridisation events for a consistent evolutionary history
    • DOI 10.1007/s00285-005-0315-9
    • M. Baroni, S. Grünewald, V. Moulton, and C. Semple, "Bounding the Number of Hybridisation Events for a Consistent Evolutionary History." J. Math. Biology, vol. 51, pp. 171-182, 2005. (Pubitemid 41040209)
    • (2005) Journal of Mathematical Biology , vol.51 , Issue.2 , pp. 171-182
    • Baroni, M.1    Grunewald, S.2    Moulton, V.3    Semple, C.4
  • 3
    • 13844296576 scopus 로고    scopus 로고
    • A Framework for Representing Reticulate Evolution
    • DOI 10.1007/s00026-004-0228-0
    • M. Baroni, C. Semple, and M. Steel, "A Framework for Representing Reticulate Evolution." Ann. Combinatorics, vol. 8, pp. 391-408, 2004. (Pubitemid 40167161)
    • (2004) Annals of combinatorics , vol.8 , Issue.4 , pp. 391-408
    • Baroni, M.1    Semple, C.2    Steel, M.3
  • 4
    • 41049088296 scopus 로고    scopus 로고
    • A reduction algorithm for computing the hybridization number of two trees
    • M. Bordewich, S. Linz, K. St. John, and C. Semple, "A Reduction Algorithm for Computing the Hybridization Number of Two Trees," Evolutionary Bioinformatics, vol. 3, pp. 86-98, 2007.
    • (2007) Evolutionary Bioinformatics , vol.3 , pp. 86-98
    • Bordewich, M.1    Linz, S.2    St. John, K.3    Semple, C.4
  • 5
    • 33947231094 scopus 로고    scopus 로고
    • Computing the minimum number of hybridization events for a consistent evolutionary history
    • DOI 10.1016/j.dam.2006.08.008, PII S0166218X06003957
    • M. Bordewich and C. Semple, "Computing the Minimum Number of Hybridization Events for a Consistent Evolutionary History," Discrete Applied Math., vol. 155, no. 8, pp. 914-928, 2007. (Pubitemid 46436152)
    • (2007) Discrete Applied Mathematics , vol.155 , Issue.8 , pp. 914-928
    • Bordewich, M.1    Semple, C.2
  • 6
    • 78149247301 scopus 로고    scopus 로고
    • Hybridnet: A tool for constructing hybridization networks
    • Z.-Z. Chen and L. Wang, "Hybridnet: A Tool for Constructing Hybridization Networks," Bioinformatics, vol. 26, no. 22, pp. 2912-2913, 2010.
    • (2010) Bioinformatics , vol.26 , Issue.22 , pp. 2912-2913
    • Chen, Z.-Z.1    Wang, L.2
  • 7
    • 80053108302 scopus 로고    scopus 로고
    • Quantifying hybridization in realistic time
    • J. Collins, S. Linz, and C. Semple, "Quantifying Hybridization in Realistic Time," J. Computational Biology, vol. 18, pp. 1305-1318, 2011.
    • (2011) J. Computational Biology , vol.18 , pp. 1305-1318
    • Collins, J.1    Linz, S.2    Semple, C.3
  • 14
    • 79954427560 scopus 로고    scopus 로고
    • A survey of combinatorial methods for phylogenetic networks
    • D.H. Huson and C. Scornavacca, "A Survey of Combinatorial Methods for Phylogenetic Networks," Genome Biology and Evolution, vol. 3, pp. 23-35, 2011.
    • (2011) Genome Biology and Evolution , vol.3 , pp. 23-35
    • Huson, D.H.1    Scornavacca, C.2
  • 15
    • 84868007353 scopus 로고    scopus 로고
    • Dendroscope 3: An interactive tool for rooted phylogenetic trees and networks
    • D.H. Huson and C. Scornavacca, "Dendroscope 3: An Interactive Tool for Rooted Phylogenetic Trees and Networks," Systematic Biology, vol. 61, no. 6, pp. 1061-1067, 2012.
    • (2012) Systematic Biology , vol.61 , Issue.6 , pp. 1061-1067
    • Huson, D.H.1    Scornavacca, C.2
  • 16
    • 84894562093 scopus 로고    scopus 로고
    • Constructing minimal phyloge-netic networks from softwired clusters is fixed parameter tractable
    • S.M. Kelk and C. Scornavacca, "Constructing Minimal Phyloge-netic Networks from Softwired Clusters Is Fixed Parameter Tractable," to appear in Algorithmica, 2012.
    • (2012) Algorithmica
    • Kelk, S.M.1    Scornavacca, C.2
  • 19
    • 84871559037 scopus 로고    scopus 로고
    • Cycle killer. qu'est-ce que c'est? on the comparative approximability of hybridization number and directed feedback vertex set
    • S.M. Kelk, L.J.J. van Iersel, S. Linz, N. Lekic, C. Scornavacca, and L. Stougie, "Cycle Killer. qu'est-ce que c'est? on the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set," SIAM J. Discrete Math., vol. 26, no. 4, pp. 1635-1656, 2012.
    • (2012) SIAM J. Discrete Math. , vol.26 , Issue.4 , pp. 1635-1656
    • Kelk, S.M.1    Van Iersel, L.J.J.2    Linz, S.3    Lekic, N.4    Scornavacca, C.5    Stougie, L.6
  • 27
    • 77954178859 scopus 로고    scopus 로고
    • Phyloge-netic networks do not need to be complex: Using fewer reticulations to represent conflicting clusters
    • L.J.J. van Iersel, S.M. Kelk, R. Rupp, and D.H. Huson, "Phyloge-netic Networks Do Not Need to Be Complex: Using Fewer Reticulations to Represent Conflicting Clusters," Bioinformatics, vol. 26, pp. i124-i131, 2010.
    • (2010) Bioinformatics , vol.26
    • Van Iersel, L.J.J.1    Kelk, S.M.2    Rupp, R.3    Huson, D.H.4


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