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.
24. MUSA: a parameter free algorithm for the identification of biologically significant motifs. Mendes ND; Casimiro AC; Santos PM; Sá-Correia I; Oliveira AL; Freitas AT Bioinformatics; 2006 Dec; 22(24):2996-3002. PubMed ID: 17068086 [TBL] [Abstract][Full Text] [Related]
25. 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]
26. Sigma: multiple alignment of weakly-conserved non-coding DNA sequence. Siddharthan R BMC Bioinformatics; 2006 Mar; 7():143. PubMed ID: 16542424 [TBL] [Abstract][Full Text] [Related]
27. A parallel pairwise local sequence alignment algorithm. Bandyopadhyay S; Mitra R IEEE Trans Nanobioscience; 2009 Jun; 8(2):139-46. PubMed ID: 19366648 [TBL] [Abstract][Full Text] [Related]
28. Gap mapping: a paradigm for aligning two sequences. Bellgard M; Gamble T; Reynolds M; Hunter A; Trifonov E; Taplin R Appl Bioinformatics; 2003; 2(3 Suppl):S31-5. PubMed ID: 15130814 [TBL] [Abstract][Full Text] [Related]
29. Comparison study on k-word statistical measures for protein: from sequence to 'sequence space'. Dai Q; Wang T BMC Bioinformatics; 2008 Sep; 9():394. PubMed ID: 18811946 [TBL] [Abstract][Full Text] [Related]
31. Statistical measures of DNA sequence dissimilarity under Markov chain models of base composition. Wu TJ; Hsieh YC; Li LA Biometrics; 2001 Jun; 57(2):441-8. PubMed ID: 11414568 [TBL] [Abstract][Full Text] [Related]
32. An efficient algorithm for identifying matches with errors in multiple long molecular sequences. Leung MY; Blaisdell BE; Burge C; Karlin S J Mol Biol; 1991 Oct; 221(4):1367-78. PubMed ID: 1942056 [TBL] [Abstract][Full Text] [Related]
33. Application of high-performance computing to numerical simulation of human movement. Anderson FC; Ziegler JM; Pandy MG; Whalen RT J Biomech Eng; 1995 Feb; 117(1):155-7. PubMed ID: 7609481 [TBL] [Abstract][Full Text] [Related]
34. Parallel hardware for sequence comparison and alignment. Hughey R Comput Appl Biosci; 1996 Dec; 12(6):473-9. PubMed ID: 9021265 [TBL] [Abstract][Full Text] [Related]
35. A test for the statistical significance of DNA sequence similarities for application in databank searches. Mott RF; Kirkwood TB; Curnow RN Comput Appl Biosci; 1989 Apr; 5(2):123-31. PubMed ID: 2720462 [TBL] [Abstract][Full Text] [Related]
36. Sequence search on a supercomputer. Gotoh O; Tagashira Y Nucleic Acids Res; 1986 Jan; 14(1):57-64. PubMed ID: 3753790 [TBL] [Abstract][Full Text] [Related]
37. Rapid similarity searches of nucleic acid and protein data banks. Wilbur WJ; Lipman DJ Proc Natl Acad Sci U S A; 1983 Feb; 80(3):726-30. PubMed ID: 6572363 [TBL] [Abstract][Full Text] [Related]
38. Making DNA add. Guarnieri F; Fliss M; Bancroft C Science; 1996 Jul; 273(5272):220-3. PubMed ID: 8662501 [TBL] [Abstract][Full Text] [Related]
39. Distributional regimes for the number of k-word matches between two random sequences. Lippert RA; Huang H; Waterman MS Proc Natl Acad Sci U S A; 2002 Oct; 99(22):13980-9. PubMed ID: 12374863 [TBL] [Abstract][Full Text] [Related]
40. Kabirian-based optinalysis: A conceptually grounded framework for symmetry/asymmetry, similarity/dissimilarity and identity/unidentity estimations in mathematical structures and biological sequences. Abdullahi KB MethodsX; 2023 Dec; 11():102400. PubMed ID: 37928104 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]