Improved parallel and sequential walking tree methods for biological string alignments

Authors:
Paul Cull;Tai Hsu
Affiliations:
Department of Computer Science, Oregon State University, Corvallis, OR;Department of Computer Science, Oregon State University, Corvallis, OR
Venue:
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Year:
1999

LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A high-performance, portable implementation of the MPI message passing interface standard

Parallel Computing
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Hi-index	0.00