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 *

140 related articles for article (PubMed ID: 23368759)

  • 21. Fast recovery of evolutionary trees with thousands of nodes.
    Csurös M
    J Comput Biol; 2002; 9(2):277-97. PubMed ID: 12015882
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 24. Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics.
    Grünewald S; Long Y; Wu Y
    Bull Math Biol; 2018 Jun; 80(6):1563-1577. PubMed ID: 29524097
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Optimal gene trees from sequences and species trees using a soft interpretation of parsimony.
    Berglund-Sonnhammer AC; Steffansson P; Betts MJ; Liberles DA
    J Mol Evol; 2006 Aug; 63(2):240-50. PubMed ID: 16830091
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 28. Matching split distance for unrooted binary phylogenetic trees.
    Bogdanowicz D; Giaro K
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):150-60. PubMed ID: 21383415
    [TBL] [Abstract][Full Text] [Related]  

  • 29. An efficient algorithm for approximating geodesic distances in tree space.
    Battagliero S; Puglia G; Vicario S; Rubino F; Scioscia G; Leo P
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1196-207. PubMed ID: 21116041
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Exact Algorithms for Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees.
    Kordi M; Bansal MS
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1077-1090. PubMed ID: 28622673
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Estimating species trees from unrooted gene trees.
    Liu L; Yu L
    Syst Biol; 2011 Oct; 60(5):661-7. PubMed ID: 21447481
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Refining discordant gene trees.
    Górecki P; Eulenstein O
    BMC Bioinformatics; 2014; 15 Suppl 13(Suppl 13):S3. PubMed ID: 25434729
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Using max cut to enhance rooted trees consistency.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
    Horesh Y; Mehr R; Unger R
    J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Quartets MaxCut: a divide and conquer quartets algorithm.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):704-18. PubMed ID: 21030737
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Recrafting the neighbor-joining method.
    Mailund T; Brodal GS; Fagerberg R; Pedersen CN; Phillips D
    BMC Bioinformatics; 2006 Jan; 7():29. PubMed ID: 16423304
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Unrooted unordered homeomorphic subtree alignment of RNA trees.
    Milo N; Zakov S; Katzenelson E; Bachmat E; Dinitz Y; Ziv-Ukelson M
    Algorithms Mol Biol; 2013 Apr; 8(1):13. PubMed ID: 23590940
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Accuracy guarantees for phylogeny reconstruction algorithms based on balanced minimum evolution.
    Bordewich M; Mihaescu R
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(3):576-83. PubMed ID: 24091392
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Fast Dating Using Least-Squares Criteria and Algorithms.
    To TH; Jung M; Lycett S; Gascuel O
    Syst Biol; 2016 Jan; 65(1):82-97. PubMed ID: 26424727
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 7.