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 *

93 related articles for article (PubMed ID: 6887269)

  • 1. Efficient algorithms for searching for exact repetition of nucleotide sequences.
    Nussinov R
    J Mol Evol; 1983; 19(3-4):283-5. PubMed ID: 6887269
    [TBL] [Abstract][Full Text] [Related]  

  • 2. An efficient code searching for sequence homology and DNA duplication.
    Nussinov R
    J Theor Biol; 1983 Jan; 100(2):319-28. PubMed ID: 6223182
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Pairwise alignment for very long nucleic acid sequences.
    Sun J; Chen K; Hao Z
    Biochem Biophys Res Commun; 2018 Jul; 502(3):313-317. PubMed ID: 29800571
    [TBL] [Abstract][Full Text] [Related]  

  • 4. FASTPAT: a fast and efficient algorithm for string searching in DNA sequences.
    Prunella N; Liuni S; Attimonelli M; Pesole G
    Comput Appl Biosci; 1993 Oct; 9(5):541-5. PubMed ID: 8293327
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Searching DNA databases for similarities to DNA sequences: when is a match significant?
    Anderson I; Brass A
    Bioinformatics; 1998; 14(4):349-56. PubMed ID: 9632830
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A teaching approach from the exhaustive search method to the Needleman-Wunsch algorithm.
    Xu Z; Yang Y; Huang B
    Biochem Mol Biol Educ; 2017 May; 45(3):194-204. PubMed ID: 27740737
    [TBL] [Abstract][Full Text] [Related]  

  • 7. CENSOR--a program for identification and elimination of repetitive elements from DNA sequences.
    Jurka J; Klonowski P; Dagman V; Pelton P
    Comput Chem; 1996 Mar; 20(1):119-21. PubMed ID: 8867843
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms.
    Pearson WR
    Genomics; 1991 Nov; 11(3):635-50. PubMed ID: 1774068
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Sequence alignment with tandem duplication.
    Benson G
    J Comput Biol; 1997; 4(3):351-67. PubMed ID: 9278065
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Comparison of methods for searching protein sequence databases.
    Pearson WR
    Protein Sci; 1995 Jun; 4(6):1145-60. PubMed ID: 7549879
    [TBL] [Abstract][Full Text] [Related]  

  • 11. On the complexity measures of genetic sequences.
    Gusev VD; Nemytikova LA; Chuzhanova NA
    Bioinformatics; 1999 Dec; 15(12):994-9. PubMed ID: 10745989
    [TBL] [Abstract][Full Text] [Related]  

  • 12. PARALIGN: rapid and sensitive sequence similarity searches powered by parallel computing technology.
    Saebø PE; Andersen SM; Myrseth J; Laerdahl JK; Rognes T
    Nucleic Acids Res; 2005 Jul; 33(Web Server issue):W535-9. PubMed ID: 15980529
    [TBL] [Abstract][Full Text] [Related]  

  • 13. SWIFOLD: Smith-Waterman implementation on FPGA with OpenCL for long DNA sequences.
    Rucci E; Garcia C; Botella G; De Giusti A; Naiouf M; Prieto-Matias M
    BMC Syst Biol; 2018 Nov; 12(Suppl 5):96. PubMed ID: 30458766
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Improving the Mapping of Smith-Waterman Sequence Database Searches onto CUDA-Enabled GPUs.
    Huang LT; Wu CC; Lai LF; Li YJ
    Biomed Res Int; 2015; 2015():185179. PubMed ID: 26339591
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Comparative biosequence metrics.
    Smith TF; Waterman MS; Fitch WM
    J Mol Evol; 1981; 18(1):38-46. PubMed ID: 7334527
    [TBL] [Abstract][Full Text] [Related]  

  • 16. 160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA).
    Li IT; Shum W; Truong K
    BMC Bioinformatics; 2007 Jun; 8():185. PubMed ID: 17555593
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Computer methods for locating kinetoplastid cryptogenes.
    von Haeseler A; Blum B; Simpson L; Sturm N; Waterman MS
    Nucleic Acids Res; 1992 Jun; 20(11):2717-24. PubMed ID: 1614859
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A parallel implementation of the Smith-Waterman algorithm for massive sequences searching.
    Liao HY; Yin ML; Cheng Y
    Conf Proc IEEE Eng Med Biol Soc; 2004; 2004():2817-20. PubMed ID: 17270863
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Striped Smith-Waterman speeds database searches six times over other SIMD implementations.
    Farrar M
    Bioinformatics; 2007 Jan; 23(2):156-61. PubMed ID: 17110365
    [TBL] [Abstract][Full Text] [Related]  

  • 20. GeneAssist. Smith-Waterman and other database similarity searches and identification of motifs.
    Shpaer EG
    Methods Mol Biol; 1997; 70():173-87. PubMed ID: 9089612
    [No Abstract]   [Full Text] [Related]  

    [Next]    [New Search]
    of 5.