Results 111 to 120 of about 41,748 (161)

Genetic characterization of <i>Listeria monocytogenes</i> strains from the Seeliger's historical "special Listeria culture collection" (1918-1986). [PDF]

Front Microbiol
Daza Prieto B, Pietzka A, Stielow JB, Lennkh A, Murer A, Eisele D, Mösenbacher T, Stöger A, Hyden P, Halbedel S, Allerberger F, Hof H, Ruppitsch W.   +12 more
europepmc   +1 more source

Competing methods of divergence time estimation recover diverse evolutionary timescales. [PDF]

Proc Biol Sci
Davies SEL, Tasca A, Álvarez-Carretero S, Brochu C, Pisani D, Donoghue PCJ.   +5 more
europepmc   +1 more source

Generalizing the Gaussian Network Model: Spanning-Tree Thermodynamics Shows Entropy-Driven KRAS Activation. [PDF]

Proteins
Ciftci FS, Erman B.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Finding Minimum Spanning Trees

SIAM Journal on Computing, 1976
This paper studies methods for finding minimum spanning trees in graphs. Results include 1. several algorithms with $O(m\log \log n)$ worst-case running times, where n is the number vertices and m is the number of edges in the problem graph; 2. an $O(m)$ worst-case algorithm for dense graphs (those for which m is $\Omega (n^{1 + \varepsilon } )$ for ...
Robert Tarjan
exaly   +4 more sources

On Generalized Minimum Spanning Trees

European Journal of Operational Research, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martine Labbé
exaly   +6 more sources

The Capacitated Minimum Spanning Tree

Networks, 1973
AbstractThe capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorithm to obtain optimal solutions.
K. Mani Chandy, Tachen Lo
openaire   +2 more sources

CLUSTERING WITH MINIMUM SPANNING TREES

International Journal on Artificial Intelligence Tools, 2011
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set of representative points and removes edges that satisfy a
Yan Zhou, Oleksandr Grygorash, Thomas F. Hain   +2 more
openaire   +1 more source

The minimum labeling spanning trees

Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruay Shiung Chang, Shing-Jiuan Leu
openaire   +3 more sources