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 *

109 related articles for article (PubMed ID: 20874407)

  • 1. Computing the summed adjacency disruption number between two genomes with duplicate genes.
    Delgado J; Lynce I; Manquinho V
    J Comput Biol; 2010 Sep; 17(9):1243-65. PubMed ID: 20874407
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes.
    Angibaud S; Fertin G; Rusu I; Thévenin A; Vialette S
    J Comput Biol; 2008 Oct; 15(8):1093-115. PubMed ID: 18774903
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Comparing genomes with duplications: a computational complexity point of view.
    Blin G; Chauve C; Fertin G; Rizzi R; Vialette S
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):523-34. PubMed ID: 17975264
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes.
    Shao M; Lin Y; Moret BM
    J Comput Biol; 2015 May; 22(5):425-35. PubMed ID: 25517208
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates.
    Angibaud S; Fertin G; Rusu I; Vialette S
    J Comput Biol; 2007 May; 14(4):379-93. PubMed ID: 17572018
    [TBL] [Abstract][Full Text] [Related]  

  • 6. On Computing Breakpoint Distances for Genomes with Duplicate Genes.
    Shao M; Moret BME
    J Comput Biol; 2017 Jun; 24(6):571-580. PubMed ID: 27788022
    [TBL] [Abstract][Full Text] [Related]  

  • 7. The median problems on linear multichromosomal genomes: graph representation and fast exact solutions.
    Xu AW
    J Comput Biol; 2010 Sep; 17(9):1195-211. PubMed ID: 20874404
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Inapproximability of (1,2)-exemplar distance.
    Bulteau L; Jiang M
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1384-90. PubMed ID: 24407297
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Sorting by Cuts, Joins, and Whole Chromosome Duplications.
    Zeira R; Shamir R
    J Comput Biol; 2017 Feb; 24(2):127-137. PubMed ID: 27704866
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A fast and exact algorithm for the median of three problem: a graph decomposition approach.
    Xu AW
    J Comput Biol; 2009 Oct; 16(10):1369-81. PubMed ID: 19747038
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. New Genome Similarity Measures based on Conserved Gene Adjacencies.
    Doerr D; Kowada LAB; Araujo E; Deshpande S; Dantas S; Moret BME; Stoye J
    J Comput Biol; 2017 Jun; 24(6):616-634. PubMed ID: 28590847
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Colored de Bruijn graphs and the genome halving problem.
    Alekseyev MA; Pevzner PA
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):98-107. PubMed ID: 17277417
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Complementing computationally predicted regulatory sites in Tractor_DB using a pattern matching approach.
    Guía MH; Pérez AG; Angarica VE; Vasconcelos AT; Collado-Vides J
    In Silico Biol; 2005; 5(2):209-19. PubMed ID: 15972018
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Maximum Likelihood Estimates of Rearrangement Distance: Implementing a Representation-Theoretic Approach.
    Terauds V; Sumner J
    Bull Math Biol; 2019 Feb; 81(2):535-567. PubMed ID: 30264286
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Pairwise alignment with rearrangements.
    Vinh le S; Varón A; Wheeler WC
    Genome Inform; 2006; 17(2):141-51. PubMed ID: 17503387
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Phylogenetic invariants for genome rearrangements.
    Sankoff D; Blanchette M
    J Comput Biol; 1999; 6(3-4):431-45. PubMed ID: 10582577
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Gene team tree: a hierarchical representation of gene teams for all gap lengths.
    Zhang M; Leong HW
    J Comput Biol; 2009 Oct; 16(10):1383-98. PubMed ID: 19803736
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Genome sequence comparison and scenarios for gene rearrangements: a test case.
    Hannenhalli S; Chappey C; Koonin EV; Pevzner PA
    Genomics; 1995 Nov; 30(2):299-311. PubMed ID: 8586431
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 6.