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 *

165 related articles for article (PubMed ID: 20529896)

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

  • 2. LNETWORK: an efficient and effective method for constructing phylogenetic networks.
    Wang J; Guo M; Liu X; Liu Y; Wang C; Xing L; Che K
    Bioinformatics; 2013 Sep; 29(18):2269-76. PubMed ID: 23811095
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Invariant transformers of Robinson and Foulds distance matrices for Convolutional Neural Network.
    Tahiri N; Veriga A; Koshkarov A; Morozov B
    J Bioinform Comput Biol; 2022 Aug; 20(4):2250012. PubMed ID: 35798684
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. BIMLR: a method for constructing rooted phylogenetic networks from rooted phylogenetic trees.
    Wang J; Guo M; Xing L; Che K; Liu X; Wang C
    Gene; 2013 Sep; 527(1):344-51. PubMed ID: 23816409
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Frin: An Efficient Method for Representing Genome Evolutionary History.
    Hong Y; Wang J
    Front Genet; 2019; 10():1261. PubMed ID: 31867045
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees.
    Wu Y; Zhang L
    J Comput Biol; 2024 Apr; 31(4):345-359. PubMed ID: 38285528
    [No Abstract]   [Full Text] [Related]  

  • 8. Transfer index, NetUniFrac and some useful shortest path-based distances for community analysis in sequence similarity networks.
    Xing H; Kembel SW; Makarenkov V
    Bioinformatics; 2020 May; 36(9):2740-2749. PubMed ID: 31971565
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Computing galled networks from real data.
    Huson DH; Rupp R; Berry V; Gambette P; Paul C
    Bioinformatics; 2009 Jun; 25(12):i85-93. PubMed ID: 19478021
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Applicability of several rooted phylogenetic network algorithms for representing the evolutionary history of SARS-CoV-2.
    Wallin R; van Iersel L; Kelk S; Stougie L
    BMC Ecol Evol; 2021 Dec; 21(1):220. PubMed ID: 34876022
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks.
    Murakami Y; van Iersel L; Janssen R; Jones M; Moulton V
    Bull Math Biol; 2019 Oct; 81(10):3823-3863. PubMed ID: 31297691
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Drawing rooted phylogenetic networks.
    Huson DH
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):103-9. PubMed ID: 19179703
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A Survey of Methods for Constructing Rooted Phylogenetic Networks.
    Wang J
    PLoS One; 2016; 11(11):e0165834. PubMed ID: 27806124
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Embedding gene trees into phylogenetic networks by conflict resolution algorithms.
    Wawerka M; Dąbkowski D; Rutecka N; Mykowiecka A; Górecki P
    Algorithms Mol Biol; 2022 May; 17(1):11. PubMed ID: 35590416
    [TBL] [Abstract][Full Text] [Related]  

  • 16. An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees.
    Wu Y
    J Comput Biol; 2013 Oct; 20(10):792-804. PubMed ID: 24093230
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fast algorithm for the reconciliation of gene trees and LGT networks.
    Scornavacca C; Mayol JCP; Cardona G
    J Theor Biol; 2017 Apr; 418():129-137. PubMed ID: 28111320
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. A new fast method for inferring multiple consensus trees using k-medoids.
    Tahiri N; Willems M; Makarenkov V
    BMC Evol Biol; 2018 Apr; 18(1):48. PubMed ID: 29621975
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Inferring explicit weighted consensus networks to represent alternative evolutionary histories.
    Layeghifard M; Peres-Neto PR; Makarenkov V
    BMC Evol Biol; 2013 Dec; 13():274. PubMed ID: 24359207
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.