Finding least-weight subsequences with fewer processors

DOI10.1007/BF01190159zbMath0778.68039OpenAlexW3159663081MaRDI QIDQ2366242

Tak Wah Lam, Kwong-fai Chan

Publication date: 29 June 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190159

zbMATH Keywords

dynamic programmingmonotone matrixCREW PRAM

Mathematics Subject Classification ID

Distributed algorithms (68W15)

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