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 *

154 related articles for article (PubMed ID: 32646365)

  • 1. Efficient implied alignment.
    Washburn AJ; Wheeler WC
    BMC Bioinformatics; 2020 Jul; 21(1):296. PubMed ID: 32646365
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Encoded expansion: an efficient algorithm to discover identical string motifs.
    Azmi AM; Al-Ssulami A
    PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
    [TBL] [Abstract][Full Text] [Related]  

  • 3. New algorithms for structure informed genome rearrangement.
    Ozeri E; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2023 Dec; 18(1):17. PubMed ID: 38037088
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An efficient algorithm for testing the compatibility of phylogenies with nested taxa.
    Deng Y; Fernández-Baca D
    Algorithms Mol Biol; 2017; 12():7. PubMed ID: 28331536
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An algorithm for progressive multiple alignment of sequences with insertions.
    Löytynoja A; Goldman N
    Proc Natl Acad Sci U S A; 2005 Jul; 102(30):10557-62. PubMed ID: 16000407
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Embedding gene trees into phylogenetic networks by conflict resolution algorithms.
    Wawerka M; Dąbkowski D; Rutecka N; Mykowiecka A; Górecki P
    Algorithms Mol Biol; 2022 May; 17(1):11. PubMed ID: 35590416
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A fast algorithm for the optimal alignment of three strings.
    Allison L
    J Theor Biol; 1993 Sep; 164(2):261-9. PubMed ID: 8246519
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Global peak alignment for comprehensive two-dimensional gas chromatography mass spectrometry using point matching algorithms.
    Deng B; Kim S; Li H; Heath E; Zhang X
    J Bioinform Comput Biol; 2016 Dec; 14(6):1650032. PubMed ID: 27650662
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Comprehensive study on iterative algorithms of multiple sequence alignment.
    Hirosawa M; Totoki Y; Hoshida M; Ishikawa M
    Comput Appl Biosci; 1995 Feb; 11(1):13-8. PubMed ID: 7796270
    [TBL] [Abstract][Full Text] [Related]  

  • 10. libFLASM: a software library for fixed-length approximate string matching.
    Ayad LA; Pissis SP; Retha A
    BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Ancestral sequence alignment under optimal conditions.
    Hudek AK; Brown DG
    BMC Bioinformatics; 2005 Nov; 6():273. PubMed ID: 16293191
    [TBL] [Abstract][Full Text] [Related]  

  • 12. SATe-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees.
    Liu K; Warnow TJ; Holder MT; Nelesen SM; Yu J; Stamatakis AP; Linder CR
    Syst Biol; 2012 Jan; 61(1):90-106. PubMed ID: 22139466
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Genomic multiple sequence alignments: refinement using a genetic algorithm.
    Wang C; Lefkowitz EJ
    BMC Bioinformatics; 2005 Aug; 6():200. PubMed ID: 16086841
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Constrained multiple sequence alignment tool development and its application to RNase family alignment.
    Tang CY; Lu CL; Chang MD; Tsai YT; Sun YJ; Chao KM; Chang JM; Chiou YH; Wu CM; Chang HT; Chou WI
    J Bioinform Comput Biol; 2003 Jul; 1(2):267-87. PubMed ID: 15290773
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The deferred path heuristic for the generalized tree alignment problem.
    Schwikowski B; Vingron M
    J Comput Biol; 1997; 4(3):415-31. PubMed ID: 9278068
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Progressive multiple alignment with constraints.
    Myers G; Selznick S; Zhang Z; Miller W
    J Comput Biol; 1996; 3(4):563-72. PubMed ID: 9018604
    [TBL] [Abstract][Full Text] [Related]  

  • 17. ALFRED: A Practical Method for Alignment-Free Distance Computation.
    Thankachan SV; Chockalingam SP; Liu Y; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):452-60. PubMed ID: 27138275
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An iterative method for faster sum-of-pairs multiple sequence alignment.
    Reinert K; Stoye J; Will T
    Bioinformatics; 2000 Sep; 16(9):808-14. PubMed ID: 11108703
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Alignment and topological accuracy of the direct optimization approach via POY and traditional phylogenetics via ClustalW + PAUP*.
    Ogden TH; Rosenberg MS
    Syst Biol; 2007 Apr; 56(2):182-93. PubMed ID: 17454974
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.