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 *

166 related articles for article (PubMed ID: 31120331)

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

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

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

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

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

  • 6. Sorting by weighted reversals, transpositions, and inverted transpositions.
    Bader M; Ohlebusch E
    J Comput Biol; 2007 Jun; 14(5):615-36. PubMed ID: 17683264
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Sorting signed permutations by short operations.
    Galvão GR; Lee O; Dias Z
    Algorithms Mol Biol; 2015; 10():12. PubMed ID: 25838839
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Sorting signed circular permutations by super short operations.
    Oliveira AR; Fertin G; Dias U; Dias Z
    Algorithms Mol Biol; 2018; 13():13. PubMed ID: 30065782
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An algorithm to enumerate sorting reversals for signed permutations.
    Siepel AC
    J Comput Biol; 2003; 10(3-4):575-97. PubMed ID: 12935346
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 16. Incorporating intergenic regions into reversal and transposition distances with indels.
    Alexandrino AO; Oliveira AR; Dias U; Dias Z
    J Bioinform Comput Biol; 2021 Dec; 19(6):2140011. PubMed ID: 34775923
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 20. Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information.
    Alexandrino AO; Oliveira AR; Jean G; Fertin G; Dias U; Dias Z
    J Comput Biol; 2023 Aug; 30(8):861-876. PubMed ID: 37222724
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.