๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient heuristic algorithm for minimum matching

โœ Scribed by P. Grassberger; H. Freund

Publisher
Springer
Year
1990
Tongue
English
Weight
653 KB
Volume
34
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Algorithm for Minimum-Weigh
An Efficient Algorithm for Minimum-Weight Bibranching
โœ J. Keijsper; R. Pendavingh ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti

A Rapid Heuristic Algorithm for Finding
A Rapid Heuristic Algorithm for Finding Minimum Evolution Trees
โœ Andrew Rodin; Wen-Hsiung Li ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 69 KB

The minimum sum of branch lengths (S), or the minimum evolution (ME) principle, has been shown to be a good optimization criterion in phylogenetic inference. Unfortunately, the number of topologies to be analyzed is computationally prohibitive when a large number of taxa are involved. Therefore, sim