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 *

205 related articles for article (PubMed ID: 9475984)

  • 1. A genetic algorithm for multiple molecular sequence alignment.
    Zhang C; Wong AK
    Comput Appl Biosci; 1997 Dec; 13(6):565-81. PubMed ID: 9475984
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Toward efficient multiple molecular sequence alignment: a system of genetic algorithm and dynamic programming.
    Zhang C; Wong AC
    IEEE Trans Syst Man Cybern B Cybern; 1997; 27(6):918-32. PubMed ID: 18263101
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Pareto optimal pairwise sequence alignment.
    DeRonne KW; Karypis G
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):481-93. PubMed ID: 23929871
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Dynamic programming.
    Nalbantoğlu ÖU
    Methods Mol Biol; 2014; 1079():3-27. PubMed ID: 24170392
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures.
    Matsui H; Sato K; Sakakibara Y
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():290-9. PubMed ID: 16448022
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
    He D; Arslan AN
    Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A memory efficient method for structure-based RNA multiple alignment.
    DeBlasio D; Bruand J; Zhang S
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):1-11. PubMed ID: 21576754
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Stochastic pairwise alignments.
    Mückstein U; Hofacker IL; Stadler PF
    Bioinformatics; 2002; 18 Suppl 2():S153-60. PubMed ID: 12385998
    [TBL] [Abstract][Full Text] [Related]  

  • 9. DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment.
    Subramanian AR; Weyer-Menkhoff J; Kaufmann M; Morgenstern B
    BMC Bioinformatics; 2005 Mar; 6():66. PubMed ID: 15784139
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Heuristic reusable dynamic programming: efficient updates of local sequence alignment.
    Hong C; Tewfik AH
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):570-82. PubMed ID: 19875856
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Dynamic programming algorithms for biological sequence comparison.
    Pearson WR; Miller W
    Methods Enzymol; 1992; 210():575-601. PubMed ID: 1584052
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure.
    Eddy SR
    BMC Bioinformatics; 2002 Jul; 3():18. PubMed ID: 12095421
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Regular language constrained sequence alignment revisited.
    Kucherov G; Pinhas T; Ziv-Ukelson M
    J Comput Biol; 2011 May; 18(5):771-81. PubMed ID: 21554020
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Dynamic use of multiple parameter sets in sequence alignment.
    Huang X; Brutlag DL
    Nucleic Acids Res; 2007; 35(2):678-86. PubMed ID: 17182633
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Combining many multiple alignments in one improved alignment.
    Bucka-Lassen K; Caprani O; Hein J
    Bioinformatics; 1999 Feb; 15(2):122-30. PubMed ID: 10089197
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An iterative refinement algorithm for consistency based multiple structural alignment methods.
    Chen Y; Crippen GM
    Bioinformatics; 2006 Sep; 22(17):2087-93. PubMed ID: 16809393
    [TBL] [Abstract][Full Text] [Related]  

  • 18. DIALIGN: finding local similarities by multiple sequence alignment.
    Morgenstern B; Frech K; Dress A; Werner T
    Bioinformatics; 1998; 14(3):290-4. PubMed ID: 9614273
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Reconfigurable systems for sequence alignment and for general dynamic programming.
    Jacobi RP; Ayala-Rincón M; Carvalho LG; Llanos CH; Hartenstein RW
    Genet Mol Res; 2005 Sep; 4(3):543-52. PubMed ID: 16342039
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Super pairwise alignment (SPA): an efficient approach to global alignment for homologous sequences.
    Shen SY; Yang J; Yao A; Hwang PI
    J Comput Biol; 2002; 9(3):477-86. PubMed ID: 12162887
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.