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 *

88 related articles for article (PubMed ID: 19747037)

  • 1. Hurdles and sorting by inversions: combinatorial, statistical, and experimental results.
    Swenson KM; Lin Y; Rajan V; Moret BM
    J Comput Biol; 2009 Oct; 16(10):1339-51. PubMed ID: 19747037
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Sorting signed permutations by inversions in O(nlogn) time.
    Swenson KM; Rajan V; Lin Y; Moret BM
    J Comput Biol; 2010 Mar; 17(3):489-501. PubMed ID: 20377459
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation.
    Gog S; Bader M
    J Comput Biol; 2008 Oct; 15(8):1029-41. PubMed ID: 18781831
    [TBL] [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. Two notes on genome rearrangement.
    Ozery-Flato M; Shamir R
    J Bioinform Comput Biol; 2003 Apr; 1(1):71-94. PubMed ID: 15290782
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 10. Efficient sorting of genomic permutations by translocation, inversion and block interchange.
    Yancopoulos S; Attie O; Friedberg R
    Bioinformatics; 2005 Aug; 21(16):3340-6. PubMed ID: 15951307
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Rearrangement models and single-cut operations.
    Bergeron A; Medvedev P; Stoye J
    J Comput Biol; 2010 Sep; 17(9):1213-25. PubMed ID: 20874405
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

  • 19. Computing the Inversion-Indel Distance.
    Willing E; Stoye J; Braga MDV
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2314-2326. PubMed ID: 32324562
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Algorithms for multiple genome rearrangement by signed reversals.
    Wu S; Gu X
    Pac Symp Biocomput; 2003; ():363-74. PubMed ID: 12603042
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.