These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

106 related articles for article (PubMed ID: 23702540)

  • 1. A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees.
    Piovesan T; Kelk SM
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):18-25. PubMed ID: 23702540
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Quantifying hybridization in realistic time.
    Collins J; Linz S; Semple C
    J Comput Biol; 2011 Oct; 18(10):1305-18. PubMed ID: 21210735
    [TBL] [Abstract][Full Text] [Related]  

  • 3. On the elusiveness of clusters.
    Kelk SM; Scornavacca C; van Iersel L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):517-34. PubMed ID: 21968961
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies.
    Humphries PJ; Linz S; Semple C
    Bull Math Biol; 2013 Oct; 75(10):1879-90. PubMed ID: 23925727
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A first step toward computing all hybridization networks for two rooted binary phylogenetic trees.
    Scornavacca C; Linz S; Albrecht B
    J Comput Biol; 2012 Nov; 19(11):1227-42. PubMed ID: 23134319
    [TBL] [Abstract][Full Text] [Related]  

  • 6. On the fixed parameter tractability of agreement-based phylogenetic distances.
    Bordewich M; Scornavacca C; Tokac N; Weller M
    J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Hybridization in nonbinary trees.
    Linz S; Semple C
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):30-45. PubMed ID: 19179697
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees.
    Huson DH; Linz S
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):398-410. PubMed ID: 26955052
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Fixed-parameter tractability of the maximum agreement supertree problem.
    Guillemot S; Berry V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Minimum-flip supertrees: complexity and algorithms.
    Chen D; Eulenstein O; Fernandez-Baca D; Sanderson M
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):165-73. PubMed ID: 17048402
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.
    Sridhar S; Dhamdhere K; Blelloch G; Halperin E; Ravi R; Schwartz R
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):561-71. PubMed ID: 17975268
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable.
    Bordewich M; Semple C
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(3):458-466. PubMed ID: 17666765
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Refining phylogenetic trees given additional data: an algorithm based on parsimony.
    Wu T; Moulton V; Steel M
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):118-25. PubMed ID: 19179705
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Maximal acyclic agreement forests.
    Voorkamp J
    J Comput Biol; 2014 Oct; 21(10):723-31. PubMed ID: 25101528
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Tanglegrams for rooted phylogenetic trees and networks.
    Scornavacca C; Zickmann F; Huson DH
    Bioinformatics; 2011 Jul; 27(13):i248-56. PubMed ID: 21685078
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A fast tool for minimum hybridization networks.
    Chen ZZ; Wang L; Yamanaka S
    BMC Bioinformatics; 2012 Jul; 13():155. PubMed ID: 22748099
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks.
    Bordewich M; Linz S; Semple C
    J Theor Biol; 2017 Jun; 423():1-12. PubMed ID: 28414085
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A fast algorithm for computing geodesic distances in tree space.
    Owen M; Provan JS
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):2-13. PubMed ID: 21071792
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
    Sand A; Brodal GS; Fagerberg R; Pedersen CN; Mailund T
    BMC Bioinformatics; 2013; 14 Suppl 2(Suppl 2):S18. PubMed ID: 23368759
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
    Jansson J; Rajaby R; Sung WK
    J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336
    [No Abstract]   [Full Text] [Related]  

    [Next]    [New Search]
    of 6.