Finding least-weight subsequences with fewer processors
From MaRDI portal
Publication:2366242
DOI10.1007/BF01190159zbMath0778.68039OpenAlexW3159663081MaRDI QIDQ2366242
Publication date: 29 June 1993
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01190159
Cites Work
- Geometric applications of a matrix-searching algorithm
- On efficient parallel computations for some dynamic programming problems
- Speeding up dynamic programming with applications to molecular biology
- An Almost Linear Time Algorithm for Generalized Matrix Searching
- Sequence comparison with mixed convex and concave costs
- The Least Weight Subsequence Problem
- The concave least-weight subsequence problem revisited
- The Parallel Evaluation of General Arithmetic Expressions
- Parallelism in random access machines
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding least-weight subsequences with fewer processors