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 *

123 related articles for article (PubMed ID: 33242309)

  • 61. Gene Tree Diameter for Deep Coalescence.
    Górecki P; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):155-65. PubMed ID: 26357086
    [TBL] [Abstract][Full Text] [Related]  

  • 62. Orchard Networks are Trees with Additional Horizontal Arcs.
    van Iersel L; Janssen R; Jones M; Murakami Y
    Bull Math Biol; 2022 Jun; 84(8):76. PubMed ID: 35727410
    [TBL] [Abstract][Full Text] [Related]  

  • 63. Labellable Phylogenetic Networks.
    Francis A; Steel M
    Bull Math Biol; 2023 Apr; 85(6):46. PubMed ID: 37097343
    [TBL] [Abstract][Full Text] [Related]  

  • 64. DTL reconciliation repair.
    Ma W; Smirnov D; Libeskind-Hadas R
    BMC Bioinformatics; 2017 Mar; 18(Suppl 3):76. PubMed ID: 28361686
    [TBL] [Abstract][Full Text] [Related]  

  • 65. Comparison of galled trees.
    Cardona G; Llabrés M; Rosselló F; Valiente G
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(2):410-27. PubMed ID: 20660951
    [TBL] [Abstract][Full Text] [Related]  

  • 66. Phylogenetic super-networks from partial trees.
    Huson DH; Dezulian T; Klopper T; Steel MA
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):151-158. PubMed ID: 17051697
    [TBL] [Abstract][Full Text] [Related]  

  • 67. Rearrangement moves on rooted phylogenetic networks.
    Gambette P; van Iersel L; Jones M; Lafond M; Pardi F; Scornavacca C
    PLoS Comput Biol; 2017 Aug; 13(8):e1005611. PubMed ID: 28763439
    [TBL] [Abstract][Full Text] [Related]  

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

  • 69. Reconciling event-labeled gene trees with MUL-trees and species networks.
    Hellmuth M; Huber KT; Moulton V
    J Math Biol; 2019 Oct; 79(5):1885-1925. PubMed ID: 31410552
    [TBL] [Abstract][Full Text] [Related]  

  • 70. Gene Tree Construction and Correction Using SuperTree and Reconciliation.
    Lafond M; Chauve C; El-Mabrouk N; Ouangraoua A
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1560-1570. PubMed ID: 28678712
    [TBL] [Abstract][Full Text] [Related]  

  • 71. A concise necessary and sufficient condition for the existence of a galled-tree.
    Song YS
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):186-91. PubMed ID: 17048404
    [TBL] [Abstract][Full Text] [Related]  

  • 72. Forest-Based Networks.
    Huber KT; Moulton V; Scholz GE
    Bull Math Biol; 2022 Sep; 84(10):119. PubMed ID: 36107279
    [TBL] [Abstract][Full Text] [Related]  

  • 73. Distinct-Cluster Tree-Child Phylogenetic Networks and Possible Uses to Study Polyploidy.
    Willson SJ
    Bull Math Biol; 2022 Sep; 84(11):125. PubMed ID: 36123552
    [TBL] [Abstract][Full Text] [Related]  

  • 74. Trinets encode orchard phylogenetic networks.
    Semple C; Toft G
    J Math Biol; 2021 Aug; 83(3):28. PubMed ID: 34420100
    [TBL] [Abstract][Full Text] [Related]  

  • 75. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.
    Wehe A; Burleigh JG; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302
    [TBL] [Abstract][Full Text] [Related]  

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

  • 77. Autopolyploidy, Allopolyploidy, and Phylogenetic Networks with Horizontal Arcs.
    Huber KT; Maher LJ
    Bull Math Biol; 2023 Apr; 85(5):40. PubMed ID: 37022524
    [TBL] [Abstract][Full Text] [Related]  

  • 78. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 79. A program to compute the soft Robinson-Foulds distance between phylogenetic networks.
    Lu B; Zhang L; Leong HW
    BMC Genomics; 2017 Mar; 18(Suppl 2):111. PubMed ID: 28361712
    [TBL] [Abstract][Full Text] [Related]  

  • 80. New approach for phylogenetic tree recovery based on genome-scale metabolic networks.
    Gamermann D; Montagud A; Conejero JA; Urchueguía JF; de Córdoba PF
    J Comput Biol; 2014 Jul; 21(7):508-19. PubMed ID: 24611553
    [TBL] [Abstract][Full Text] [Related]  

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