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 *

91 related articles for article (PubMed ID: 10977071)

  • 1. A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data.
    Cosner ME; Jansen RK; Moret BM; Raubeson LA; Wang LS; Warnow T; Wyman S
    Proc Int Conf Intell Syst Mol Biol; 2000; 8():104-15. PubMed ID: 10977071
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A new implementation and detailed study of breakpoint analysis.
    Moret BM; Wyman S; Bader DA; Warnow T; Yan M
    Pac Symp Biocomput; 2001; ():583-94. PubMed ID: 11262975
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. New approaches for reconstructing phylogenies from gene order data.
    Moret BM; Wang LS; Warnow T; Wyman SK
    Bioinformatics; 2001; 17 Suppl 1():S165-73. PubMed ID: 11473006
    [TBL] [Abstract][Full Text] [Related]  

  • 5. FastJoin, an improved neighbor-joining algorithm.
    Wang J; Guo MZ; Xing LL
    Genet Mol Res; 2012 Jul; 11(3):1909-22. PubMed ID: 22869546
    [TBL] [Abstract][Full Text] [Related]  

  • 6. The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation.
    Lemmon AR; Milinkovitch MC
    Proc Natl Acad Sci U S A; 2002 Aug; 99(16):10516-21. PubMed ID: 12142465
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Parsimony score of phylogenetic networks: hardness results and a linear-time heuristic.
    Jin G; Nakhleh L; Snir S; Tuller T
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):495-505. PubMed ID: 19644176
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data.
    Lewis PO
    Mol Biol Evol; 1998 Mar; 15(3):277-83. PubMed ID: 9501494
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the quality of tree-based protein classification.
    Lazareva-Ulitsky B; Diemer K; Thomas PD
    Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Stability analysis of phylogenetic trees.
    Sheikh SI; Kahveci T; Ranka S; Gordon Burleigh J
    Bioinformatics; 2013 Jan; 29(2):166-74. PubMed ID: 23162082
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle.
    Desper R; Gascuel O
    J Comput Biol; 2002; 9(5):687-705. PubMed ID: 12487758
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Early eukaryote evolution based on mitochondrial gene order breakpoints.
    Sankoff D; Bryant D; Deneault M; Lang BF; Burger G
    J Comput Biol; 2000; 7(3-4):521-35. PubMed ID: 11108477
    [TBL] [Abstract][Full Text] [Related]  

  • 14. SDM: a fast distance-based approach for (super) tree building in phylogenomics.
    Criscuolo A; Berry V; Douzery EJ; Gascuel O
    Syst Biol; 2006 Oct; 55(5):740-55. PubMed ID: 17060196
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Rearrangement-based phylogeny using the Single-Cut-or-Join operation.
    Biller P; Feijão P; Meidanis J
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):122-34. PubMed ID: 23702549
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Beyond pairwise distances: neighbor-joining with phylogenetic diversity estimates.
    Levy D; Yoshida R; Pachter L
    Mol Biol Evol; 2006 Mar; 23(3):491-8. PubMed ID: 16280538
    [TBL] [Abstract][Full Text] [Related]  

  • 17. SATe-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees.
    Liu K; Warnow TJ; Holder MT; Nelesen SM; Yu J; Stamatakis AP; Linder CR
    Syst Biol; 2012 Jan; 61(1):90-106. PubMed ID: 22139466
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A rapid heuristic algorithm for finding minimum evolution trees.
    Rodin A; Li WH
    Mol Phylogenet Evol; 2000 Aug; 16(2):173-9. PubMed ID: 10942605
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Inferring polyploid phylogenies from multiply-labeled gene trees.
    Lott M; Spillner A; Huber KT; Petri A; Oxelman B; Moulton V
    BMC Evol Biol; 2009 Aug; 9():216. PubMed ID: 19715596
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.