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 *

61 related articles for article (PubMed ID: 21702689)

  • 1. The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time.
    Firoz JS; Hasan M; Khan AZ; Rahman MS
    J Comput Biol; 2011 Aug; 18(8):1007-11. PubMed ID: 21702689
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 6. Fast molecular shape matching using contact maps.
    Agarwal PK; Mustafa NH; Wang Y
    J Comput Biol; 2007 Mar; 14(2):131-43. PubMed ID: 17456012
    [TBL] [Abstract][Full Text] [Related]  

  • 7. On complexity of protein structure alignment problem under distance constraint.
    Poleksic A
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):511-6. PubMed ID: 22025757
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A 1.375-approximation algorithm for sorting by transpositions.
    Elias I; Hartman T
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):369-79. PubMed ID: 17085846
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Searching protein 3-D structures in linear time.
    Shibuya T
    J Comput Biol; 2010 Mar; 17(3):203-19. PubMed ID: 20377441
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 16. A (1.5 + epsilon)-approximation algorithm for unsigned translocation distance.
    Cui Y; Wang L; Zhu D; Liu X
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):56-66. PubMed ID: 18245875
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 19. On the nearest neighbour interchange distance between evolutionary trees.
    Li M; Tromp J; Zhang L
    J Theor Biol; 1996 Oct; 182(4):463-7. PubMed ID: 8944893
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 4.