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 *

157 related articles for article (PubMed ID: 34895113)

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

  • 22. Most parsimonious reconciliation in the presence of gene duplication, loss, and deep coalescence using labeled coalescent trees.
    Wu YC; Rasmussen MD; Bansal MS; Kellis M
    Genome Res; 2014 Mar; 24(3):475-86. PubMed ID: 24310000
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios.
    Lyubetsky VA; Rubanov LI; Rusin LY; Gorbunov KY
    Biol Direct; 2012 Dec; 7():48. PubMed ID: 23259766
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Enumeration of compact coalescent histories for matching gene trees and species trees.
    Disanto F; Rosenberg NA
    J Math Biol; 2019 Jan; 78(1-2):155-188. PubMed ID: 30116881
    [TBL] [Abstract][Full Text] [Related]  

  • 25. New algorithms for structure informed genome rearrangement.
    Ozeri E; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2023 Dec; 18(1):17. PubMed ID: 38037088
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Reconciliation revisited: handling multiple optima when reconciling with duplication, transfer, and loss.
    Bansal MS; Alm EJ; Kellis M
    J Comput Biol; 2013 Oct; 20(10):738-54. PubMed ID: 24033262
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Genome-wide probabilistic reconciliation analysis across vertebrates.
    Mahmudi O; Sjöstrand J; Sennblad B; Lagergren J
    BMC Bioinformatics; 2013; 14 Suppl 15(Suppl 15):S10. PubMed ID: 24564421
    [TBL] [Abstract][Full Text] [Related]  

  • 28. On the impact of uncertain gene tree rooting on duplication-transfer-loss reconciliation.
    Kundu S; Bansal MS
    BMC Bioinformatics; 2018 Aug; 19(Suppl 9):290. PubMed ID: 30367593
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 30. An efficient algorithm for testing the compatibility of phylogenies with nested taxa.
    Deng Y; Fernández-Baca D
    Algorithms Mol Biol; 2017; 12():7. PubMed ID: 28331536
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Phylogenetic Flexibility via Hall-Type Inequalities and Submodularity.
    Huber KT; Moulton V; Steel M
    Bull Math Biol; 2019 Feb; 81(2):598-617. PubMed ID: 29589255
    [TBL] [Abstract][Full Text] [Related]  

  • 32. A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem.
    Bansal MS; Shamir R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):848-50. PubMed ID: 20733245
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Enumeration of Ancestral Configurations for Matching Gene Trees and Species Trees.
    Disanto F; Rosenberg NA
    J Comput Biol; 2017 Sep; 24(9):831-850. PubMed ID: 28437136
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Testing the agreement of trees with internal labels.
    Fernández-Baca D; Liu L
    Algorithms Mol Biol; 2021 Dec; 16(1):22. PubMed ID: 34863219
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem.
    Górecki P; Eulenstein O
    BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S14. PubMed ID: 22759419
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.
    Chaudhary R; Burleigh JG; Eulenstein O
    BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S11. PubMed ID: 22759416
    [TBL] [Abstract][Full Text] [Related]  

  • 37. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
    Jansson J; Rajaby R; Sung WK
    J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336
    [No Abstract]   [Full Text] [Related]  

  • 38. Reconciliation of a gene network and species tree.
    Chan YB; Robin C
    J Theor Biol; 2019 Jul; 472():54-66. PubMed ID: 30951730
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Reconciliation of gene and species trees.
    Rusin LY; Lyubetskaya EV; Gorbunov KY; Lyubetsky VA
    Biomed Res Int; 2014; 2014():642089. PubMed ID: 24800245
    [TBL] [Abstract][Full Text] [Related]  

  • 40. On Determining if Tree-based Networks Contain Fixed Trees.
    Anaya M; Anipchenko-Ulaj O; Ashfaq A; Chiu J; Kaiser M; Ohsawa MS; Owen M; Pavlechko E; St John K; Suleria S; Thompson K; Yap C
    Bull Math Biol; 2016 May; 78(5):961-9. PubMed ID: 27125655
    [TBL] [Abstract][Full Text] [Related]  

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