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 *

144 related articles for article (PubMed ID: 23658708)

  • 1. Ancestral genome inference using a genetic algorithm approach.
    Gao N; Yang N; Tang J
    PLoS One; 2013; 8(5):e62156. PubMed ID: 23658708
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. An exact solver for the DCJ median problem.
    Zhang M; Arndt W; Tang J
    Pac Symp Biocomput; 2009; ():138-49. PubMed ID: 19209699
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Achieving large and distant ancestral genome inference by using an improved discrete quantum-behaved particle swarm optimization algorithm.
    Zhang Z; Wang W; Xia R; Pan G; Wang J; Tang J
    BMC Bioinformatics; 2020 Nov; 21(1):516. PubMed ID: 33176688
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Small parsimony for natural genomes in the DCJ-indel model.
    Doerr D; Chauve C
    J Bioinform Comput Biol; 2021 Dec; 19(6):2140009. PubMed ID: 34806948
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Median Solver and Phylogenetic Inference Based on Double-Cut-and-Join Sorting.
    Xia R; Lin Y; Zhou J; Feng B; Tang J
    J Comput Biol; 2018 Mar; 25(3):302-312. PubMed ID: 29035570
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Cooperative Co-Evolutionary Genetic Algorithm for Tree Scoring and Ancestral Genome Inference.
    Gao N; Zhang Y; Feng B; Tang J
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1248-54. PubMed ID: 26671797
    [TBL] [Abstract][Full Text] [Related]  

  • 8. The SCJ Small Parsimony Problem for Weighted Gene Adjacencies.
    Luhmann N; Lafond M; Thevenin A; Ouangraoua A; Wittler R; Chauve C
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1364-1373. PubMed ID: 28166504
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Sorting Linear Genomes with Rearrangements and Indels.
    Braga MD; Stoye J
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(3):500-6. PubMed ID: 26357261
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Restricted DCJ model: rearrangement problems with chromosome reincorporation.
    Kováč J; Warren R; Braga MD; Stoye J
    J Comput Biol; 2011 Sep; 18(9):1231-41. PubMed ID: 21899428
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes.
    Bérard S; Chateau A; Chauve C; Paul C; Tannier E
    J Comput Biol; 2009 Oct; 16(10):1287-309. PubMed ID: 19803733
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The solution space of sorting by DCJ.
    Braga MD; Stoye J
    J Comput Biol; 2010 Sep; 17(9):1145-65. PubMed ID: 20874401
    [TBL] [Abstract][Full Text] [Related]  

  • 13. UniMoG--a unifying framework for genomic distance calculation and sorting based on DCJ.
    Hilker R; Sickinger C; Pedersen CN; Stoye J
    Bioinformatics; 2012 Oct; 28(19):2509-11. PubMed ID: 22815356
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Algorithms for sorting unsigned linear genomes by the DCJ operations.
    Jiang H; Zhu B; Zhu D
    Bioinformatics; 2011 Feb; 27(3):311-6. PubMed ID: 21134895
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Phylogenetic reconstruction from transpositions.
    Yue F; Zhang M; Tang J
    BMC Genomics; 2008 Sep; 9 Suppl 2(Suppl 2):S15. PubMed ID: 18831780
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A mixture framework for inferring ancestral gene orders.
    Zhang Y; Hu F; Tang J
    BMC Genomics; 2012; 13 Suppl 1(Suppl 1):S7. PubMed ID: 22369143
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Computing the family-free DCJ similarity.
    Rubert DP; Hoshino EA; Braga MDV; Stoye J; Martinez FV
    BMC Bioinformatics; 2018 May; 19(Suppl 6):152. PubMed ID: 29745861
    [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. Gene rearrangement analysis and ancestral order inference from chloroplast genomes with inverted repeat.
    Yue F; Cui L; dePamphilis CW; Moret BM; Tang J
    BMC Genomics; 2008; 9 Suppl 1(Suppl 1):S25. PubMed ID: 18366615
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 8.