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 *

164 related articles for article (PubMed ID: 27788022)

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

  • 2. A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.
    Shao M; Moret BM
    J Comput Biol; 2016 May; 23(5):337-46. PubMed ID: 26953781
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 5. A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance.
    Wei Z; Zhu D; Wang L
    J Comput Biol; 2015 Jul; 22(7):666-76. PubMed ID: 26161597
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An Integer Linear Programming Approach for Scaffolding Based on Exemplar Breakpoint Distance.
    Shieh YK; Peng DY; Chen YH; Wu TW; Lu CL
    J Comput Biol; 2022 Sep; 29(9):961-973. PubMed ID: 35638936
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Scaffold filling under the breakpoint and related distances.
    Jiang H; Zheng C; Sankoff D; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1220-9. PubMed ID: 22529329
    [TBL] [Abstract][Full Text] [Related]  

  • 10. The gene family-free median of three.
    Doerr D; Balaban M; Feijão P; Chauve C
    Algorithms Mol Biol; 2017; 12():14. PubMed ID: 28559921
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Computing the Rearrangement Distance of Natural Genomes.
    Bohnenkämper L; Braga MDV; Doerr D; Stoye J
    J Comput Biol; 2021 Apr; 28(4):410-431. PubMed ID: 33393848
    [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. Comparing genomes with rearrangements and segmental duplications.
    Shao M; Moret BM
    Bioinformatics; 2015 Jun; 31(12):i329-38. PubMed ID: 26072500
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Compromise or optimize? The breakpoint anti-median.
    Larlee CA; Brandts A; Sankoff D
    BMC Bioinformatics; 2016 Dec; 17(Suppl 18):473. PubMed ID: 28105920
    [TBL] [Abstract][Full Text] [Related]  

  • 16. The zero exemplar distance problem.
    Jiang M
    J Comput Biol; 2011 Sep; 18(9):1077-86. PubMed ID: 21899417
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Approaching the One-Sided Exemplar Adjacency Number Problem.
    Qingge L; Smith K; Jungst S; Wang B; Yang Q; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(6):1946-1954. PubMed ID: 31056506
    [TBL] [Abstract][Full Text] [Related]  

  • 18. SCJ: a breakpoint-like distance that simplifies several rearrangement problems.
    Feijão P; Meidanis J
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1318-29. PubMed ID: 21339538
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An exact algorithm for the zero exemplar breakpoint distance problem.
    Zhu D; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1469-77. PubMed ID: 24407305
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Fast ancestral gene order reconstruction of genomes with unequal gene content.
    Feijão P; Araujo E
    BMC Bioinformatics; 2016 Nov; 17(Suppl 14):413. PubMed ID: 28185578
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.