𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved watershed algorithm based on efficient computation of shortest paths

✍ Scribed by Víctor Osma-Ruiz; Juan I. Godino-Llorente; Nicolás Sáenz-Lechón; Pedro Gómez-Vilda

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
402 KB
Volume
40
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient implementation of an algori
An efficient implementation of an algorithm for findingK shortest simple paths
✍ Hadjiconstantinou, E.; Christofides, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB 👁 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho

An algorithm to improve the computationa
An algorithm to improve the computational efficiency of genetic linkage analysis
✍ Michael S. Braverman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 910 KB

The computational complexity of genetic linkage analysis can increase exponentially with the square of the number of alleles at a marker locus. Many of the most informative marker loci have a large number of associated alleles. The precise identities of the alleles are irrelevant to the linkage anal