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 *

125 related articles for article (PubMed ID: 11694179)

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

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

  • 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. New bounds and tractable instances for the transposition distance.
    Labarre A
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):380-94. PubMed ID: 17085847
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Computing the reversal distance between genomes in the presence of multi-gene families via binary integer programming.
    Suksawatchon J; Lursinsap C; Bodén M
    J Bioinform Comput Biol; 2007 Feb; 5(1):117-33. PubMed ID: 17477494
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the inversion-indel distance.
    Willing E; Zaccaria S; Braga MD; Stoye J
    BMC Bioinformatics; 2013; 14 Suppl 15(Suppl 15):S3. PubMed ID: 24564182
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Computing the Rearrangement Distance of Natural Genomes.
    Bohnenkämper L; Braga MDV; Doerr D; Stoye J
    J Comput Biol; 2021 Apr; 28(4):410-431. PubMed ID: 33393848
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Fast computation of distance estimators.
    Elias I; Lagergren J
    BMC Bioinformatics; 2007 Mar; 8():89. PubMed ID: 17355623
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Computing Reeb Graphs as a Union of Contour Trees.
    Doraiswamy H; Natarajan V
    IEEE Trans Vis Comput Graph; 2013 Feb; 19(2):249-62. PubMed ID: 22529327
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees.
    Tierny J; Gyulassy A; Simon E; Pascucci V
    IEEE Trans Vis Comput Graph; 2009; 15(6):1177-84. PubMed ID: 19834187
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A simple algorithm for detecting circular permutations in proteins.
    Uliel S; Fliess A; Amir A; Unger R
    Bioinformatics; 1999 Nov; 15(11):930-6. PubMed ID: 10743559
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Fitting a geometric graph to a protein-protein interaction network.
    Higham DJ; Rasajski M; Przulj N
    Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Computing Nonoverlapping Inversion Distance Between Two Strings in Linear Average Time.
    Wang X; Wang L
    J Comput Biol; 2019 Mar; 26(3):193-201. PubMed ID: 30638400
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.