Shortest path and closure algorithms for banded matrices

doi:10.1016/0020-0190(91)90200-2

Information Processing Letters

Volume 40, Issue 6, 30 December 1991, Pages 317-322

https://doi.org/10.1016/0020-0190(91)90200-2 Get rights and content

Abstract

A fast algorithm is given for the all-pairs shortest paths problem for banded matrices having band-width b. It solves the negative-cycle problem and calculates all path lengths within the band in O(nb²) time and calculates all other path lengths in O(n²b) time.

References (11)

L. Allison et al.
Shortest path and closure algorithms for banded matrices
(1989)
L. Allison et al.
Restriction site mapping is in separation theory
Comp. Appl. BioSciences
(1989)
E.W. Dijkstra
A note on two problems in connexion with graphs
Numer. Math.
(1959)
T.I. Dix et al.
Errors between sites in restriction site mapping
Comput. Appl. BioSciences
(1988)
I.S. Duff
Survey of sparse matrix research
Proc. IEEE
(1977)

There are more references available in the full text version of this article.

Cited by (5)

A platform for restriction mapping
1997, Journal of Logic Programming
Restriction mapping involves finding certain sites on a DNA molecule. Biologists perform a variety of experiments to obtain data that are subject to error of method. The diversity of experimental data makes restriction mapping a complicated synthesis of information processing and constraint satisfaction. We present a theoretical framework that treats constraints for the various techniques in a homogeneous and consistent manner. Our implementation is written in CLP(R), includes the main techniques used by biologists, and encourages the building of maps incrementally. We also show how to consider more recent experimental techniques in the framework.
Detection and analysis of table of contents based on content association
2006, International Journal on Document Analysis and Recognition
On the limitations of automated restriction mapping
1994, Bioinformatics
Efficient parallel shortest path algorithms for banded matrices
1993, Proceedings of the International Conference on Parallel Processing
Modelling errors in restriction mapping
1993, Proceedings of the Annual Hawaii International Conference on System Sciences

^∗: Partially supported by Australian Research Grants A48830856 and A48932050.

View full text

Shortest path and closure algorithms for banded matrices

Abstract

Shortest path and closure algorithms for banded matrices

Restriction site mapping is in separation theory

Comp. Appl. BioSciences

A note on two problems in connexion with graphs

Numer. Math.

Errors between sites in restriction site mapping

Comput. Appl. BioSciences

Survey of sparse matrix research

Proc. IEEE