The exact algorithm formulated by Kececioglu and Starrett (2004) provides a solution to the NP-complete problem of aligning alignments in most biological cases.  This work investigates potential speedups that may be gained through the parallelization of the dynamic programming phase of this particular algorithm.   Results indicate it is possible to improve the run time performance of the algorithm over non-trivial alignments that compose to a matrix of greater than   10^5 cells

Hameed, A

University of Tasmania Open Access Repository

A dictionary of genetics,

A general method applicable to the search for similarities in the amino acid sequence of two proteins',

A linear space algorithm for computing maximal common subsequences',

A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison', Pacific

A Universal Computer Capable of Executing an Arbitrary Number of Subprograms Simultaneously',

Algorithms on Strings, Trees and Sequences:

Aligning alignments exactly',

Aligning Alignments',

Amino Acid Substitution Matrices from Protein Blocks',

An improved algorithm for matching biological sequences',

Applications of parallel processing algorithms for DNA sequence analysis',

Atlas of protein sequence and structure,

BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark',

BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs',

Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins,

Bioinformatics: sequence and genome analysis,

BLAZE(TM): An implementation of the Smith-Waterman sequence comparison algorithm on a massively parallel computer',

CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice',

ClustalW-MPI: ClustalW analysis using distributed and parallel computing',

Comparative analysis of multiple protein-sequence alignment methods [published erratum appears in Mol Biol Evol

Computational molecular biology: An Algorithmic Approach,

DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors',

DIALIGN: finding local similarities by multiple sequence alignment',

Exhaustive matching of the entire protein sequence database',

Identification of Common Molecular Subsequences',

Improving the Practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment',

Intel Dual-Channel DDR Memory Architecture White paper,

Molecular Structure Of Nucleic Acids A Structure for Deoxyribose Nucleic Acid',

Mutation data matrix and its uses',

On an efficient parallelization of exhaustive sequence comparison algorithms on message passing architectures',

On the complexity of multiple sequence alignment',

Parallel computation in biological sequence analysis',

Parallel programming: techniques and applications using networked workstations and parallel computers, Prentice-Hall, Inc. Upper Saddle River,

Patterns for parallel programming,

Recent progress in multiple sequence alignment: a survey',

SETI@ home: an experiment in public-resource computing',

Software tools for analyzing pairwise alignments of long sequences',

T-Coffee: A novel method for fast and accurate multiple sequence alignment',

The blueprint for life?'

The Maximum Weight Trace Problem in Multiple Sequence Alignment',

The Multiple Sequence Alignment Problem in Biology',

The Oxford English Dictionary 2nd Edition.

Validity of the single processor approach to achieving large scale computing capabilities',

Parallelization of the AAE algorithm