Breaking the computational barriers of pairwise genome comparison.

ABSTRACT:

Background

Conventional pairwise sequence comparison software algorithms are being used to process much larger datasets than they were originally designed for. This can result in processing bottlenecks that limit software capabilities or prevent full use of the available hardware resources. Overcoming the barriers that limit the efficient computational analysis of large biological sequence datasets by retrofitting existing algorithms or by creating new applications represents a major challenge for the bioinformatics community.

Results

We have developed C libraries for pairwise sequence comparison within diverse architectures, ranging from commodity systems to high performance and cloud computing environments. Exhaustive tests were performed using different datasets of closel

SUBMITTER: Torreno O 

PROVIDER: S-EPMC4531504 | biostudies-literature | 2015 Aug

REPOSITORIES: biostudies-literature