BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

162 related articles for article (PubMed ID: 19407347)

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

  • 22. Topological rearrangements and local search method for tandem duplication trees.
    Bertrand D; Gascuel O
    IEEE/ACM Trans Comput Biol Bioinform; 2005; 2(1):15-28. PubMed ID: 17044161
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.
    Markin A; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1063-1076. PubMed ID: 28650824
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Reconstructing a SuperGeneTree minimizing reconciliation.
    Lafond M; Ouangraoua A; El-Mabrouk N
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S4. PubMed ID: 26451911
    [TBL] [Abstract][Full Text] [Related]  

  • 25. morePhyML: improving the phylogenetic tree space exploration with PhyML 3.
    Criscuolo A
    Mol Phylogenet Evol; 2011 Dec; 61(3):944-8. PubMed ID: 21925283
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Hamiltonian walks of phylogenetic treespaces.
    Gordon K; Ford E; St John K
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):1076-9. PubMed ID: 24334399
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Fast local search for unrooted Robinson-Foulds supertrees.
    Chaudhary R; Burleigh JG; Fernández-Baca D
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Reconciliation with non-binary species trees.
    Vernot B; Stolzer M; Goldman A; Durand D
    J Comput Biol; 2008 Oct; 15(8):981-1006. PubMed ID: 18808330
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Consistency of topological moves based on the balanced minimum evolution principle of phylogenetic inference.
    Bordewich M; Gascuel O; Huber KT; Moulton V
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):110-7. PubMed ID: 19179704
    [TBL] [Abstract][Full Text] [Related]  

  • 30. IQPNNI: moving fast through tree space and stopping in time.
    Vinh le S; Von Haeseler A
    Mol Biol Evol; 2004 Aug; 21(8):1565-71. PubMed ID: 15163768
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Locating large-scale gene duplication events through reconciled trees: implications for identifying ancient polyploidy events in plants.
    Burleigh JG; Bansal MS; Wehe A; Eulenstein O
    J Comput Biol; 2009 Aug; 16(8):1071-83. PubMed ID: 19689214
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. Inferring duplication episodes from unrooted gene trees.
    Paszek J; Górecki P
    BMC Genomics; 2018 May; 19(Suppl 5):288. PubMed ID: 29745844
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Exact median-tree inference for unrooted reconciliation costs.
    Górecki P; Markin A; Eulenstein O
    BMC Evol Biol; 2020 Oct; 20(Suppl 1):136. PubMed ID: 33115401
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Inferring optimal species trees under gene duplication and loss.
    Bayzid MS; Mirarab S; Warnow T
    Pac Symp Biocomput; 2013; ():250-61. PubMed ID: 23424130
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A simple algorithm to infer gene duplication and speciation events on a gene tree.
    Zmasek CM; Eddy SR
    Bioinformatics; 2001 Sep; 17(9):821-8. PubMed ID: 11590098
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Efficient Algorithms for Genomic Duplication Models.
    Paszek J; Gorecki P
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1515-1524. PubMed ID: 28541223
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A hybrid micro-macroevolutionary approach to gene tree reconstruction.
    Durand D; Halldórsson BV; Vernot B
    J Comput Biol; 2006 Mar; 13(2):320-35. PubMed ID: 16597243
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Genomic duplication problems for unrooted gene trees.
    Paszek J; Górecki P
    BMC Genomics; 2016 Jan; 17 Suppl 1(Suppl 1):15. PubMed ID: 26818591
    [TBL] [Abstract][Full Text] [Related]  

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