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 *

169 related articles for article (PubMed ID: 29994030)

  • 1. An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements.
    Hartmann T; Bernt M; Middendorf M
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):52-62. PubMed ID: 29994030
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Genome Rearrangement with ILP.
    Hartmann T; Wieseke N; Sharan R; Middendorf M; Bernt M
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1585-1593. PubMed ID: 28574364
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Sorting Signed Permutations by Inverse Tandem Duplication Random Losses.
    Hartmann T; Bannach M; Middendorf M
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2177-2188. PubMed ID: 31095495
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 7. Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes.
    Hartmann T; Chu AC; Middendorf M; Bernt M
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(1):83-95. PubMed ID: 28114075
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

  • 15. A New Efficient Algorithm for the All Sorting Reversals Problem with No Bad Components.
    Wang BF
    IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(4):599-609. PubMed ID: 26353380
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

    [Next]    [New Search]
    of 9.