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 *

135 related articles for article (PubMed ID: 24407297)

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

  • 2. Genome rearrangement with gene families.
    Sankoff D
    Bioinformatics; 1999 Nov; 15(11):909-17. PubMed ID: 10743557
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

  • 11. libFLASM: a software library for fixed-length approximate string matching.
    Ayad LA; Pissis SP; Retha A
    BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 14. Assignment of orthologous genes via genome rearrangement.
    Chen X; Zheng J; Fu Z; Nan P; Zhong Y; Lonardi S; Jiang T
    IEEE/ACM Trans Comput Biol Bioinform; 2005; 2(4):302-15. PubMed ID: 17044168
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. A Linear-Time Algorithm for the Copy Number Transformation Problem.
    Zeira R; Zehavi M; Shamir R
    J Comput Biol; 2017 Dec; 24(12):1179-1194. PubMed ID: 28837352
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Genome halving and double distance with losses.
    Savard OT; Gagnon Y; Bertrand D; El-Mabrouk N
    J Comput Biol; 2011 Sep; 18(9):1185-99. PubMed ID: 21899424
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Rearrangement models and single-cut operations.
    Bergeron A; Medvedev P; Stoye J
    J Comput Biol; 2010 Sep; 17(9):1213-25. PubMed ID: 20874405
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Sorting genomes by translocations and deletions.
    Qi X; Li G; Li S; Xu Y
    Comput Syst Bioinformatics Conf; 2006; ():157-66. PubMed ID: 17369634
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.