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 *

122 related articles for article (PubMed ID: 22845836)

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

  • 22. Bounds for phylogenetic network space metrics.
    Francis A; Huber KT; Moulton V; Wu T
    J Math Biol; 2018 Apr; 76(5):1229-1248. PubMed ID: 28836230
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations.
    Huber KT; Linz S; Moulton V; Wu T
    J Math Biol; 2016 Feb; 72(3):699-725. PubMed ID: 26037483
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Tree-based networks: characterisations, metrics, and support trees.
    Pons JC; Semple C; Steel M
    J Math Biol; 2019 Mar; 78(4):899-918. PubMed ID: 30283985
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Generation of Level- k LGT Networks.
    Pons JC; Scornavacca C; Cardona G
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):158-164. PubMed ID: 30703035
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Nonbinary Tree-Based Phylogenetic Networks.
    Jetten L; van Iersel L
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(1):205-217. PubMed ID: 27723601
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Constructing a minimum phylogenetic network from a dense triplet set.
    Habib M; To TH
    J Bioinform Comput Biol; 2012 Oct; 10(5):1250013. PubMed ID: 22849368
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Constructing level-2 phylogenetic networks from triplets.
    van Iersel L; Keijsper J; Kelk S; Stougie L; Hagen F; Boekhout T
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):667-81. PubMed ID: 19875864
    [TBL] [Abstract][Full Text] [Related]  

  • 30. constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints.
    Matsen FA
    J Comput Biol; 2010 Jun; 17(6):799-818. PubMed ID: 20500096
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Biological Network Edit Distance.
    McGrane M; Charleston MA
    J Comput Biol; 2016 Sep; 23(9):776-88. PubMed ID: 27308778
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Constructing splits graphs.
    Dress AW; Huson DH
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(3):109-15. PubMed ID: 17048386
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Phylogenetic Comparative Methods on Phylogenetic Networks with Reticulations.
    Bastide P; Solís-Lemus C; Kriebel R; William Sparks K; Ané C
    Syst Biol; 2018 Sep; 67(5):800-820. PubMed ID: 29701821
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. A Resolution of the Static Formulation Question for the Problem of Computing the History Bound.
    Matsieva J; Kelk S; Scornavacca C; Whidden C; Gusfield D
    IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(2):404-417. PubMed ID: 26887004
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Inferring phylogenetic networks by the maximum parsimony criterion: a case study.
    Jin G; Nakhleh L; Snir S; Tuller T
    Mol Biol Evol; 2007 Jan; 24(1):324-37. PubMed ID: 17068107
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A new efficient algorithm for inferring explicit hybridization networks following the Neighbor-Joining principle.
    Willems M; Tahiri N; Makarenkov V
    J Bioinform Comput Biol; 2014 Oct; 12(5):1450024. PubMed ID: 25219384
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters.
    van Iersel L; Kelk S; Rupp R; Huson D
    Bioinformatics; 2010 Jun; 26(12):i124-31. PubMed ID: 20529896
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Comparison of tree-child phylogenetic networks.
    Cardona G; Rosselló F; Valiente G
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):552-69. PubMed ID: 19875855
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Tree-metrizable HGT networks.
    Hendriksen M; Francis A
    Math Biosci; 2019 Dec; 318():108283. PubMed ID: 31711966
    [TBL] [Abstract][Full Text] [Related]  

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