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 *

68 related articles for article (PubMed ID: 12487761)

  • 1. A lower bound on the reversal and transposition diameter.
    Meidanis J; Walter MM; Dias Z
    J Comput Biol; 2002; 9(5):743-5. PubMed ID: 12487761
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 7. Sorting circular permutations by bounded transpositions.
    Feng X; Chitturi B; Sudborough H
    Adv Exp Med Biol; 2010; 680():725-36. PubMed ID: 20865560
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Comparing genomes with duplications: a computational complexity point of view.
    Blin G; Chauve C; Fertin G; Rizzi R; Vialette S
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):523-34. PubMed ID: 17975264
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances.
    Adam Z; Sankoff D
    J Comput Biol; 2010 Sep; 17(9):1299-314. PubMed ID: 20874410
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 14. Labeled Cycle Graph for Transposition and Indel Distance.
    Alexandrino AO; Oliveira AR; Dias U; Dias Z
    J Comput Biol; 2022 Mar; 29(3):243-256. PubMed ID: 34724796
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Inapproximability of (1,2)-exemplar distance.
    Bulteau L; Jiang M
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1384-90. PubMed ID: 24407297
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes.
    Brito KL; Jean G; Fertin G; Oliveira AR; Dias U; Dias Z
    J Comput Biol; 2020 Feb; 27(2):156-174. PubMed ID: 31891533
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A new 1.375-approximation algorithm for sorting by transpositions.
    Silva LAG; Kowada LAB; Rocco NR; Walter MEMT
    Algorithms Mol Biol; 2022 Jan; 17(1):1. PubMed ID: 35033127
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A Linear-Time Algorithm for the Copy Number Transformation Problem.
    Zeira R; Zehavi M; Shamir R
    J Comput Biol; 2017 Dec; 24(12):1179-1194. PubMed ID: 28837352
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Opposition-Based Memetic Algorithm and Hybrid Approach for Sorting Permutations by Reversals.
    Soncco-Álvarez JL; Muñoz DM; Ayala-Rincón M
    Evol Comput; 2019; 27(2):229-265. PubMed ID: 29466026
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 4.