Related Experiment Video
Updated: Jun 17, 2026

DNAzyme 10-23 - Based Nanomachines for Nucleic Acid Recognition
Published on: February 9, 2024
Evaluating DNA sequence searching algorithms on multicore
1Department of Electrical and Computer Engineering, Southern Illinois University, 1230 Lincoln Drive, Carbondale, IL 62901, USA. weng@engr.siu.edu
Abstract:
Sequence searching is one of major operations in modern bioengineering. Recent emerging multicore provides a promising technology to enhance sequence searching performance. However, efficiently employing the multicore for a uniprocessor-oriented algorithm is a difficult task. This paper presents a methodology to profile processing requirements for DNA sequence search algorithms, parallelise them onto multicore, and analytically evaluate their performance. The key feature of this methodology is that entire processes are automated and it requires users little understanding of the complexity of algorithms and multicore hardware architecture. Our methodology considers three approaches to parallelise searching operations: queries, database, and task segmentation.
Related Concept Videos
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
Parallel Processing
RNA-seq
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while microarray-based...
Evolutionary Relationships through Genome Comparisons
