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.
3. Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism. Bhandarkar SM; Chirravuri S; Arnold J J Comput Biol; 1996; 3(4):503-28. PubMed ID: 9018601 [TBL] [Abstract][Full Text] [Related]
4. Searching for distantly related protein sequences in large databases by parallel processing on a transputer machine. Vogt G; Argos P Comput Appl Biosci; 1992 Feb; 8(1):49-55. PubMed ID: 1568125 [TBL] [Abstract][Full Text] [Related]
6. Efficient constrained multiple sequence alignment with performance guarantee. Chin FY; Ho NL; Lam TW; Wong PW; Chan MY Proc IEEE Comput Soc Bioinform Conf; 2003; 2():337-46. PubMed ID: 16452809 [TBL] [Abstract][Full Text] [Related]
7. 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]
8. Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers. Fang Z; Li X; Ni LM IEEE Trans Pattern Anal Mach Intell; 1987 Jun; 9(6):835-41. PubMed ID: 21869445 [TBL] [Abstract][Full Text] [Related]
9. 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]
10. The massively parallel genetic algorithm for RNA folding: MIMD implementation and population variation. Shapiro BA; Wu JC; Bengali D; Potts MJ Bioinformatics; 2001 Feb; 17(2):137-48. PubMed ID: 11238069 [TBL] [Abstract][Full Text] [Related]
11. Parallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm. Miller PL; Nadkarni PM; Carriero NM Comput Appl Biosci; 1991 Jan; 7(1):71-8. PubMed ID: 2004277 [TBL] [Abstract][Full Text] [Related]
12. Euclidean distance transform for binary images on reconfigurable mesh-connected computers. Pan Y; Hamdi M; Li K IEEE Trans Syst Man Cybern B Cybern; 2000; 30(1):240-4. PubMed ID: 18244749 [TBL] [Abstract][Full Text] [Related]
13. An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings. Allen DR; Thankachan SV; Xu B IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):138-148. PubMed ID: 31985439 [TBL] [Abstract][Full Text] [Related]
14. Recent developments in linear-space alignment methods: a survey. Chao KM; Hardison RC; Miller W J Comput Biol; 1994; 1(4):271-91. PubMed ID: 8790471 [TBL] [Abstract][Full Text] [Related]
15. Multiple sequence alignment with affine gap by using multi-objective genetic algorithm. Kaya M; Sarhan A; Alhajj R Comput Methods Programs Biomed; 2014 Apr; 114(1):38-49. PubMed ID: 24534604 [TBL] [Abstract][Full Text] [Related]
16. Approximate matching of regular expressions. Myers EW; Miller W Bull Math Biol; 1989; 51(1):5-37. PubMed ID: 2706401 [TBL] [Abstract][Full Text] [Related]
17. Parallel progressive multiple sequence alignment on reconfigurable meshes. Nguyen KD; Pan Y; Nong G BMC Genomics; 2011 Dec; 12 Suppl 5(Suppl 5):S4. PubMed ID: 22369070 [TBL] [Abstract][Full Text] [Related]