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 *

182 related articles for article (PubMed ID: 18781831)

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

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

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

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

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

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

  • 7. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study.
    Bader DA; Moret BM; Yan M
    J Comput Biol; 2001; 8(5):483-91. PubMed ID: 11694179
    [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. A faster 1.375-approximation algorithm for sorting by transpositions.
    Cunha LF; Kowada LA; Hausen Rde A; de Figueiredo CM
    J Comput Biol; 2015 Nov; 22(11):1044-56. PubMed ID: 26383040
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Sorting by short swaps.
    Heath LS; Vergara JP
    J Comput Biol; 2003; 10(5):775-89. PubMed ID: 14633399
    [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 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]  

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

  • 15. Genomic sorting with length-weighted reversals.
    Pinter RY; Skiena S
    Genome Inform; 2002; 13():103-11. PubMed ID: 14571379
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

    [Next]    [New Search]
    of 10.