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 *

85 related articles for article (PubMed ID: 17572020)

  • 1. Sorting by reciprocal translocations via reversals theory.
    Ozery-Flato M; Shamir R
    J Comput Biol; 2007 May; 14(4):408-22. PubMed ID: 17572020
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Sorting genomes by translocations and deletions.
    Qi X; Li G; Li S; Xu Y
    Comput Syst Bioinformatics Conf; 2006; ():157-66. PubMed ID: 17369634
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Sorting genomes by reciprocal translocations, insertions, and deletions.
    Qi X; Li G; Li S; Xu Y
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):365-74. PubMed ID: 20431155
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. On sorting by translocations.
    Bergeron A; Mixtacki J; Stoye J
    J Comput Biol; 2006 Mar; 13(2):567-78. PubMed ID: 16597257
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Sorting genomes with centromeres by translocations.
    Ozery-Flato M; Shamir R
    J Comput Biol; 2008 Sep; 15(7):793-812. PubMed ID: 18652529
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 12. Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes.
    Alekseyev MA
    J Comput Biol; 2008 Oct; 15(8):1117-31. PubMed ID: 18788907
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 16. Evolution under reversals: parsimony and conservation of common intervals.
    Diekmann Y; Sagot MF; Tannier E
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(2):301-9. PubMed ID: 17473322
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

    [Next]    [New Search]
    of 5.