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 *

152 related articles for article (PubMed ID: 20583925)

  • 1. The imperfect ancestral recombination graph reconstruction problem: upper bounds for recombination and homoplasy.
    Lam F; Tarpine R; Istrail S
    J Comput Biol; 2010 Jun; 17(6):767-81. PubMed ID: 20583925
    [TBL] [Abstract][Full Text] [Related]  

  • 2. The number of recombination events in a sample history: conflict graph and lower bounds.
    Bafna V; Bansal V
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(2):78-90. PubMed ID: 17048383
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Constructing minimal ancestral recombination graphs.
    Song YS; Hein J
    J Comput Biol; 2005 Mar; 12(2):147-69. PubMed ID: 15767774
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution.
    Song YS; Wu Y; Gusfield D
    Bioinformatics; 2005 Jun; 21 Suppl 1():i413-22. PubMed ID: 15961486
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Inference of Ancestral Recombination Graphs through Topological Data Analysis.
    Cámara PG; Levine AJ; Rabadán R
    PLoS Comput Biol; 2016 Aug; 12(8):e1005071. PubMed ID: 27532298
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Resolution of the Static Formulation Question for the Problem of Computing the History Bound.
    Matsieva J; Kelk S; Scornavacca C; Whidden C; Gusfield D
    IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(2):404-417. PubMed ID: 26887004
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Quartet-based phylogeny reconstruction with answer set programming.
    Wu G; You JH; Lin G
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):139-52. PubMed ID: 17277421
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the computational complexity of the reticulate cophylogeny reconstruction problem.
    Libeskind-Hadas R; Charleston MA
    J Comput Biol; 2009 Jan; 16(1):105-17. PubMed ID: 19119995
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Reconstructing ancestral genomic sequences by co-evolution: formal definitions, computational issues, and biological examples.
    Tuller T; Birin H; Kupiec M; Ruppin E
    J Comput Biol; 2010 Sep; 17(9):1327-44. PubMed ID: 20874411
    [TBL] [Abstract][Full Text] [Related]  

  • 11. The Multi-State Perfect Phylogeny Problem with missing and removable data: solutions via integer-programming and chordal graph theory.
    Gusfield D
    J Comput Biol; 2010 Mar; 17(3):383-99. PubMed ID: 20377452
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Reconstruction of ancestral gene orders using intermediate genomes.
    Feijão P
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S3. PubMed ID: 26451811
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.
    Lyubetsky V; Gershgorin R; Gorbunov K
    BMC Bioinformatics; 2017 Dec; 18(1):537. PubMed ID: 29212445
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Recombination detection and analysis using RDP3.
    Martin DP
    Methods Mol Biol; 2009; 537():185-205. PubMed ID: 19378145
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances.
    Adam Z; Sankoff D
    J Comput Biol; 2010 Sep; 17(9):1299-314. PubMed ID: 20874410
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the repeat-annotated phylogenetic tree reconstruction problem.
    Swidan F; Ziv-Ukelson M; Pinter RY
    J Comput Biol; 2006 Oct; 13(8):1397-418. PubMed ID: 17061918
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Analysing recombination in nucleotide sequences.
    Martin DP; Lemey P; Posada D
    Mol Ecol Resour; 2011 Nov; 11(6):943-55. PubMed ID: 21592314
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Bayesian coestimation of phylogeny and sequence alignment.
    Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
    BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A concise necessary and sufficient condition for the existence of a galled-tree.
    Song YS
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):186-91. PubMed ID: 17048404
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction.
    Chauve C; Hausd UU; Stephen T; You VP
    J Comput Biol; 2010 Sep; 17(9):1167-81. PubMed ID: 20874402
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.