Parallelizing genetic linkage analysis: A case study for applying parallel computation in molecular biology
Miller P, Nadkarni P, Gelernter J, Carriero N, Pakstis A, Kidd K. Parallelizing genetic linkage analysis: A case study for applying parallel computation in molecular biology. Journal Of Biomedical Informatics 1991, 24: 234-248. PMID: 1868693, DOI: 10.1016/0010-4809(91)90046-y.Peer-Reviewed Original ResearchConceptsParallel computersSequential programsMachine-independent parallel programming languageParallel programming languageDifferent parallel machinesLengthy computation timeParallel programsProgramming languageAvailable processorsDifferent processorsParallel computationParallel machinesSequential versionParallel versionComputational loadComputation timePerformance benchmarksComputerProcessorsCase studyDifferent piecesIterative programsLINKMAPComputationParallel formsParallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm
Miller P, Nadkarni P, Carriero N. Parallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm. Bioinformatics 1991, 7: 71-78. PMID: 2004277, DOI: 10.1093/bioinformatics/7.1.71.Peer-Reviewed Original ResearchConceptsSequence comparison algorithmAmount of computationMachine-independent parallel programming languageComparison algorithmsDisk I/OParallel programming languageParallel program runsO bottleneck problemDifferent parallel machinesBiological sequence comparisonNumber of processorsTime-consuming computationProgramming languageParallelization strategyParallel computationParallel machinesProgram design strategiesProgram runBottleneck problemFASTA algorithmFASTAAlgorithmComputationBottleneckGeneral problem