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 *

116 related articles for article (PubMed ID: 38194376)

  • 1. Flanked Block-Interchange Distance on Strings.
    Li T; Jiang H; Zhu B; Wang L; Zhu D
    IEEE/ACM Trans Comput Biol Bioinform; 2024; 21(2):301-311. PubMed ID: 38194376
    [TBL] [Abstract][Full Text] [Related]  

  • 2. GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences.
    Wang D; Wang L
    BMC Bioinformatics; 2018 Aug; 19(Suppl 9):291. PubMed ID: 30367596
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Analysis of genome rearrangement by block-interchanges.
    Lu CL; Lin YC; Huang YL; Tang CY
    Methods Mol Biol; 2007; 396():121-34. PubMed ID: 18025690
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species.
    Lin YC; Lu CL; Chang HY; Tang CY
    J Comput Biol; 2005; 12(1):102-12. PubMed ID: 15725736
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An O([Formula: see text]) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges.
    Yu S; Hao F; Leong HW
    J Bioinform Comput Biol; 2016 Feb; 14(1):1640002. PubMed ID: 26707923
    [TBL] [Abstract][Full Text] [Related]  

  • 7. New algorithms for structure informed genome rearrangement.
    Ozeri E; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2023 Dec; 18(1):17. PubMed ID: 38037088
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Core-genome scaffold comparison reveals the prevalence that inversion events are associated with pairs of inverted repeats.
    Wang D; Li S; Guo F; Ning K; Wang L
    BMC Genomics; 2017 Mar; 18(1):268. PubMed ID: 28356070
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Sorting by reversals, generalized transpositions, and translocations using permutation groups.
    Huang YL; Lu CL
    J Comput Biol; 2010 May; 17(5):685-705. PubMed ID: 20500022
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Sorting by reversals and block-interchanges with various weight assignments.
    Lin YC; Lin CY; Lin CR
    BMC Bioinformatics; 2009 Dec; 10():398. PubMed ID: 19958558
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Analysis of circular genome rearrangement by fusions, fissions and block-interchanges.
    Lu CL; Huang YL; Wang TC; Chiu HT
    BMC Bioinformatics; 2006 Jun; 7():295. PubMed ID: 16768797
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 14. A new 1.375-approximation algorithm for sorting by transpositions.
    Silva LAG; Kowada LAB; Rocco NR; Walter MEMT
    Algorithms Mol Biol; 2022 Jan; 17(1):1. PubMed ID: 35033127
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Heuristics for Genome Rearrangement Distance With Replicated Genes.
    Siqueira G; Brito KL; Dias U; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2094-2108. PubMed ID: 34232886
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A 2-Approximation Scheme for Sorting Signed Permutations by Reversals, Transpositions, Transreversals, and Block-Interchanges.
    Hao F; Zhang M; Leong HW
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1702-1711. PubMed ID: 28678711
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Assembling contigs in draft genomes using reversals and block-interchanges.
    Li CL; Chen KT; Lu CL
    BMC Bioinformatics; 2013; 14 Suppl 5(Suppl 5):S9. PubMed ID: 23734866
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Approximate strip exchanging.
    Roy S; Thakur AK
    Int J Comput Biol Drug Des; 2008; 1(1):88-101. PubMed ID: 20055003
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.