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 *

151 related articles for article (PubMed ID: 31603793)

  • 1. Heuristics for the Reversal and Transposition Distance Problem.
    Brito KL; Oliveira AR; Dias U; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):2-13. PubMed ID: 31603793
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A general heuristic for genome rearrangement problems.
    Dias U; Galvão GR; Lintzmayer CN; Dias Z
    J Bioinform Comput Biol; 2014 Jun; 12(3):1450012. PubMed ID: 24969750
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Sorting permutations by prefix and suffix rearrangements.
    Lintzmayer CN; Fertin G; Dias Z
    J Bioinform Comput Biol; 2017 Feb; 15(1):1750002. PubMed ID: 28201946
    [TBL] [Abstract][Full Text] [Related]  

  • 4. On the Complexity of Sorting by Reversals and Transpositions Problems.
    Oliveira AR; Brito KL; Dias U; Dias Z
    J Comput Biol; 2019 Nov; 26(11):1223-1229. PubMed ID: 31120331
    [No Abstract]   [Full Text] [Related]  

  • 5. Perfect sorting by reversals is not always difficult.
    Bérard S; Bergeron A; Chauve C; Paul C
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):4-16. PubMed ID: 17277409
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Sorting permutations by fragmentation-weighted operations.
    Alexandrino AO; Lintzmayer CN; Dias Z
    J Bioinform Comput Biol; 2020 Apr; 18(2):2050006. PubMed ID: 32326802
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Sorting by Weighted Reversals and Transpositions.
    Rodrigues Oliveira A; Lima Brito K; Dias Z; Dias U
    J Comput Biol; 2019 May; 26(5):420-431. PubMed ID: 30785331
    [No Abstract]   [Full Text] [Related]  

  • 9. Sorting permutations by cut-circularize-linearize-and-paste operations.
    Huang KH; Chen KT; Lu CL
    BMC Genomics; 2011 Nov; 12 Suppl 3(Suppl 3):S26. PubMed ID: 22369173
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Sorting Permutations by Intergenic Operations.
    Oliveira AR; Jean G; Fertin G; Brito KL; Dias U; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2080-2093. PubMed ID: 33945484
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Sorting Signed Permutations by Intergenic Reversals.
    Oliveira AR; Jean G; Fertin G; Brito KL; Bulteau L; Dias U; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2870-2876. PubMed ID: 32396097
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A GRASP-Based Heuristic for the Sorting by Length-Weighted Inversions Problem.
    Arruda TDS; Dias U; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):352-363. PubMed ID: 26336142
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Multiple genome rearrangement by reversals.
    Wu S; Gu X
    Pac Symp Biocomput; 2002; ():259-70. PubMed ID: 11928481
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Opposition-Based Memetic Algorithm and Hybrid Approach for Sorting Permutations by Reversals.
    Soncco-Álvarez JL; Muñoz DM; Ayala-Rincón M
    Evol Comput; 2019; 27(2):229-265. PubMed ID: 29466026
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Heuristics for the transposition distance problem.
    Dias U; Dias Z
    J Bioinform Comput Biol; 2013 Oct; 11(5):1350013. PubMed ID: 24131057
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
    Bader M; Abouelhoda MI; Ohlebusch E
    BMC Bioinformatics; 2008 Dec; 9():516. PubMed ID: 19055792
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Sorting Circular Permutations by Super Short Reversals.
    Galvao GR; Baudet C; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(3):620-633. PubMed ID: 26761858
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 8.