BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

123 related articles for article (PubMed ID: 29994585)

  • 1. Calculating the Unrooted Subtree Prune-and-Regraft Distance.
    Whidden C; Matsen F
    IEEE/ACM Trans Comput Biol Bioinform; 2018 Feb; ():. PubMed ID: 29994585
    [TBL] [Abstract][Full Text] [Related]  

  • 2. SPR distance computation for unrooted trees.
    Hickey G; Dehne F; Rau-Chaplin A; Blouin C
    Evol Bioinform Online; 2008 Feb; 4():17-27. PubMed ID: 19204804
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Supertrees Based on the Subtree Prune-and-Regraft Distance.
    Whidden C; Zeh N; Beiko RG
    Syst Biol; 2014 Jul; 63(4):566-81. PubMed ID: 24695589
    [TBL] [Abstract][Full Text] [Related]  

  • 4. On Hill et al's conjecture for calculating the subtree prune and regraft distance between phylogenies.
    Linz S
    BMC Evol Biol; 2010 Oct; 10():334. PubMed ID: 21034464
    [TBL] [Abstract][Full Text] [Related]  

  • 5. 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]  

  • 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. A duality based 2-approximation algorithm for maximum agreement forest.
    Olver N; Schalekamp F; van der Ster S; Stougie L; van Zuylen A
    Math Program; 2023; 198(1):811-853. PubMed ID: 36845754
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A practical method for exact computation of subtree prune and regraft distance.
    Wu Y
    Bioinformatics; 2009 Jan; 25(2):190-6. PubMed ID: 19019848
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number.
    Yamada K; Chen ZZ; Wang L
    J Comput Biol; 2020 Sep; 27(9):1422-1432. PubMed ID: 32048865
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the complexity of uSPR distance.
    Bonet ML; St John K
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(3):572-6. PubMed ID: 20671326
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Ranked Subtree Prune and Regraft.
    Collienne L; Whidden C; Gavryushkin A
    Bull Math Biol; 2024 Jan; 86(3):24. PubMed ID: 38294587
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Phylogenetic identification of lateral genetic transfer events.
    Beiko RG; Hamilton N
    BMC Evol Biol; 2006 Feb; 6():15. PubMed ID: 16472400
    [TBL] [Abstract][Full Text] [Related]  

  • 13. On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees.
    Choi KP; Thompson A; Wu T
    Theor Popul Biol; 2020 Apr; 132():92-104. PubMed ID: 32135170
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves.
    Janssen R; Jones M; Erdős PL; van Iersel L; Scornavacca C
    Bull Math Biol; 2018 Aug; 80(8):2177-2208. PubMed ID: 29948885
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Median quartet tree search algorithms using optimal subtree prune and regraft.
    Arasti S; Mirarab S
    Algorithms Mol Biol; 2024 Mar; 19(1):12. PubMed ID: 38481327
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Walks on SPR neighborhoods.
    Caceres AJ; Castillo J; Lee J; St John K
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):236-9. PubMed ID: 23702562
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Quantifying MCMC exploration of phylogenetic tree space.
    Whidden C; Matsen FA
    Syst Biol; 2015 May; 64(3):472-91. PubMed ID: 25631175
    [TBL] [Abstract][Full Text] [Related]  

  • 19. SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees.
    Hill T; Nordström KJ; Thollesson M; Säfström TM; Vernersson AK; Fredriksson R; Schiöth HB
    BMC Evol Biol; 2010 Feb; 10():42. PubMed ID: 20152048
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.
    Berry V; Nicolas F
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):289-302. PubMed ID: 17048466
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.