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 *

72 related articles for article (PubMed ID: 21116045)

  • 21. Monte Carlo estimation of total variation distance of Markov chains on large spaces, with application to phylogenetics.
    Herbei R; Kubatko L
    Stat Appl Genet Mol Biol; 2013 Mar; 12(1):39-48. PubMed ID: 23459470
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Markov-modulated Markov chains and the covarion process of molecular evolution.
    Galtier N; Jean-Marie A
    J Comput Biol; 2004; 11(4):727-33. PubMed ID: 15579241
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Bayesian restoration of a hidden Markov chain with applications to DNA sequencing.
    Churchill GA; Lazareva B
    J Comput Biol; 1999; 6(2):261-77. PubMed ID: 10421527
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A lower bound on the reversal and transposition diameter.
    Meidanis J; Walter MM; Dias Z
    J Comput Biol; 2002; 9(5):743-5. PubMed ID: 12487761
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Ancestral population genomics using coalescence hidden Markov models and heuristic optimisation algorithms.
    Cheng JY; Mailund T
    Comput Biol Chem; 2015 Aug; 57():80-92. PubMed ID: 25819138
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Sorting by weighted reversals, transpositions, and inverted transpositions.
    Bader M; Ohlebusch E
    J Comput Biol; 2007 Jun; 14(5):615-36. PubMed ID: 17683264
    [TBL] [Abstract][Full Text] [Related]  

  • 27. An algorithm to enumerate sorting reversals for signed permutations.
    Siepel AC
    J Comput Biol; 2003; 10(3-4):575-97. PubMed ID: 12935346
    [TBL] [Abstract][Full Text] [Related]  

  • 28. New bounds and tractable instances for the transposition distance.
    Labarre A
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):380-94. PubMed ID: 17085847
    [TBL] [Abstract][Full Text] [Related]  

  • 29. A 2-approximation for the minimum duplication speciation problem.
    Ouangraoua A; Swenson KM; Chauve C
    J Comput Biol; 2011 Sep; 18(9):1041-53. PubMed ID: 21899414
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Consistency of sequence-based gene clusters.
    Wittler R; Maňuch J; Patterson M; Stoye J
    J Comput Biol; 2011 Sep; 18(9):1023-39. PubMed ID: 21899413
    [TBL] [Abstract][Full Text] [Related]  

  • 31. BioHMM: a heterogeneous hidden Markov model for segmenting array CGH data.
    Marioni JC; Thorne NP; Tavaré S
    Bioinformatics; 2006 May; 22(9):1144-6. PubMed ID: 16533818
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Sorting signed permutations by short operations.
    Galvão GR; Lee O; Dias Z
    Algorithms Mol Biol; 2015; 10():12. PubMed ID: 25838839
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Discriminating between rate heterogeneity and interspecific recombination in DNA sequence alignments with phylogenetic factorial hidden Markov models.
    Husmeier D
    Bioinformatics; 2005 Sep; 21 Suppl 2():ii166-72. PubMed ID: 16204097
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Class of multiple sequence alignment algorithm affects genomic analysis.
    Blackburne BP; Whelan S
    Mol Biol Evol; 2013 Mar; 30(3):642-53. PubMed ID: 23144040
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Markovian approximation to the finite loci coalescent with recombination along multiple sequences.
    Hobolth A; Jensen JL
    Theor Popul Biol; 2014 Dec; 98():48-58. PubMed ID: 24486389
    [TBL] [Abstract][Full Text] [Related]  

  • 36. An approximation algorithm for the minimum breakpoint linearization problem.
    Chen X; Cui Y
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):401-9. PubMed ID: 19644168
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Discovery of regulatory elements in vertebrates through comparative genomics.
    Prakash A; Tompa M
    Nat Biotechnol; 2005 Oct; 23(10):1249-56. PubMed ID: 16211068
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Using hidden Markov models and observed evolution to annotate viral genomes.
    McCauley S; Hein J
    Bioinformatics; 2006 Jun; 22(11):1308-16. PubMed ID: 16613911
    [TBL] [Abstract][Full Text] [Related]  

  • 39. DNA word analysis based on the distribution of the distances between symmetric words.
    Tavares AHMP; Pinho AJ; Silva RM; Rodrigues JMOS; Bastos CAC; Ferreira PJSG; Afreixo V
    Sci Rep; 2017 Apr; 7(1):728. PubMed ID: 28389642
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Approximating the double-cut-and-join distance between unsigned genomes.
    Chen X; Sun R; Yu J
    BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S17. PubMed ID: 22151948
    [TBL] [Abstract][Full Text] [Related]  

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