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 *

137 related articles for article (PubMed ID: 22151948)

  • 1. Approximating the double-cut-and-join distance between unsigned genomes.
    Chen X; Sun R; Yu J
    BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S17. PubMed ID: 22151948
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance.
    Feijão P; Martinez F; Thévenin A
    BMC Bioinformatics; 2015; 16 Suppl 19(Suppl 19):S1. PubMed ID: 26695008
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Approximating the DCJ distance of balanced genomes in linear time.
    Rubert DP; Feijão P; Braga MDV; Stoye J; Martinez FHV
    Algorithms Mol Biol; 2017; 12():3. PubMed ID: 28293275
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 7. Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.
    da Silva PH; Machado R; Dantas S; Braga MD
    BMC Bioinformatics; 2012; 13 Suppl 19(Suppl 19):S14. PubMed ID: 23281630
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A (1.5 + epsilon)-approximation algorithm for unsigned translocation distance.
    Cui Y; Wang L; Zhu D; Liu X
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):56-66. PubMed ID: 18245875
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Genome rearrangement by the double cut and join operation.
    Friedberg R; Darling AE; Yancopoulos S
    Methods Mol Biol; 2008; 452():385-416. PubMed ID: 18566774
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Genome Rearrangement Distance with Reversals, Transpositions, and Indels.
    Alexandrino AO; Oliveira AR; Dias U; Dias Z
    J Comput Biol; 2021 Mar; 28(3):235-247. PubMed ID: 33085536
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Extending the algebraic formalism for genome rearrangements to include linear chromosomes.
    Feijão P; Meidanis J
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):819-31. PubMed ID: 24334378
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Investigating the complexity of the double distance problems.
    Braga MDV; Brockmann LR; Klerx K; Stoye J
    Algorithms Mol Biol; 2024 Jan; 19(1):1. PubMed ID: 38178195
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. On the rank-distance median of 3 permutations.
    Chindelevitch L; Pereira Zanetti JP; Meidanis J
    BMC Bioinformatics; 2018 May; 19(Suppl 6):142. PubMed ID: 29745865
    [TBL] [Abstract][Full Text] [Related]  

  • 18. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. A general framework for genome rearrangement with biological constraints.
    Simonaitis P; Chateau A; Swenson KM
    Algorithms Mol Biol; 2019; 14():15. PubMed ID: 31360217
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.