BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

702 related articles for article (PubMed ID: 17456016)

  • 21. Using max cut to enhance rooted trees consistency.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842
    [TBL] [Abstract][Full Text] [Related]  

  • 22. A structural EM algorithm for phylogenetic inference.
    Friedman N; Ninio M; Pe'er I; Pupko T
    J Comput Biol; 2002; 9(2):331-53. PubMed ID: 12015885
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences.
    Lacey MR; Chang JT
    Math Biosci; 2006 Feb; 199(2):188-215. PubMed ID: 16412478
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Maximum likelihood of phylogenetic networks.
    Jin G; Nakhleh L; Snir S; Tuller T
    Bioinformatics; 2006 Nov; 22(21):2604-11. PubMed ID: 16928736
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Comparison of Boolean analysis and standard phylogenetic methods using artificially evolved and natural mt-tRNA sequences from great apes.
    Ari E; Ittzés P; Podani J; Thi QC; Jakó E
    Mol Phylogenet Evol; 2012 Apr; 63(1):193-202. PubMed ID: 22289866
    [TBL] [Abstract][Full Text] [Related]  

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

  • 27. Fast computation of distance estimators.
    Elias I; Lagergren J
    BMC Bioinformatics; 2007 Mar; 8():89. PubMed ID: 17355623
    [TBL] [Abstract][Full Text] [Related]  

  • 28. On the inference of parsimonious indel evolutionary scenarios.
    Chindelevitch L; Li Z; Blais E; Blanchette M
    J Bioinform Comput Biol; 2006 Jun; 4(3):721-44. PubMed ID: 16960972
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Introducing TreeCollapse: a novel greedy algorithm to solve the cophylogeny reconstruction problem.
    Drinkwater B; Charleston MA
    BMC Bioinformatics; 2014; 15 Suppl 16(Suppl 16):S14. PubMed ID: 25521705
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A practical algorithm for reconstructing level-1 phylogenetic networks.
    Huber KT; van Iersel L; Kelk S; Suchecki R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):635-49. PubMed ID: 21393651
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Characterizing the phylogenetic tree-search problem.
    Money D; Whelan S
    Syst Biol; 2012 Mar; 61(2):228-39. PubMed ID: 22076302
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Co-divergence and tree topology.
    Calamoneri T; Monti A; Sinaimeri B
    J Math Biol; 2019 Aug; 79(3):1149-1167. PubMed ID: 31203388
    [TBL] [Abstract][Full Text] [Related]  

  • 34. A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
    Bader M; Abouelhoda MI; Ohlebusch E
    BMC Bioinformatics; 2008 Dec; 9():516. PubMed ID: 19055792
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Computational reconstruction of ancestral DNA sequences.
    Blanchette M; Diallo AB; Green ED; Miller W; Haussler D
    Methods Mol Biol; 2008; 422():171-84. PubMed ID: 18629667
    [TBL] [Abstract][Full Text] [Related]  

  • 37. On the inference of large phylogenies with long branches: how long is too long?
    Mossel E; Roch S; Sly A
    Bull Math Biol; 2011 Jul; 73(7):1627-44. PubMed ID: 20931293
    [TBL] [Abstract][Full Text] [Related]  

  • 38. DPRml: distributed phylogeny reconstruction by maximum likelihood.
    Keane TM; Naughton TJ; Travers SA; McInerney JO; McCormack GP
    Bioinformatics; 2005 Apr; 21(7):969-74. PubMed ID: 15513992
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Finding nested common intervals efficiently.
    Blin G; Faye D; Stoye J
    J Comput Biol; 2010 Sep; 17(9):1183-94. PubMed ID: 20874403
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Better methods for solving parsimony and compatibility.
    Bonet M; Steel M; Warnow T; Yooseph S
    J Comput Biol; 1998; 5(3):391-407. PubMed ID: 9773340
    [TBL] [Abstract][Full Text] [Related]  

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