Finding least-weight subsequences with fewer processors
- 1 June 1993
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 9 (6) , 615-628
- https://doi.org/10.1007/bf01190159
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Sequence comparison with mixed convex and concave costsJournal of Algorithms, 1990
- An Almost Linear Time Algorithm for Generalized Matrix SearchingSIAM Journal on Discrete Mathematics, 1990
- Speeding up dynamic programming with applications to molecular biologyTheoretical Computer Science, 1989
- On efficient parallel computations for some dynamic programming problemsTheoretical Computer Science, 1988
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- The Least Weight Subsequence ProblemSIAM Journal on Computing, 1987
- Parallel tree contraction and its applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel Prefix ComputationJournal of the ACM, 1980
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974