✦ LIBER ✦

Fishing for minimum evolution trees with Neighbor-Nets

✍ Scribed by Bastkowski, Sarah; Spillner, Andreas; Moulton, Vincent

Book ID: 122333108
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 327 KB
Volume: 114
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.10.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Trees with second minimum general Randić

Trees with second minimum general Randić index for

✍ Renying Chang; Guizhen Liu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 322 KB

Approximations for Steiner Trees with Mi

Approximations for Steiner Trees with Minimum Number of Steiner Points

✍ DONGHUI CHEN; DING-ZHU DU; XIAO-DONG HU; GUO-HUI LIN; LUSHENG WANG; GUOLIANG XUE 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 156 KB

Spanning Trees with Many Leaves in Graph

Spanning Trees with Many Leaves in Graphs With Minimum Degree Three

✍ Bonsma, Paul S. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 222 KB

Tabu search with strategic oscillation f

Tabu search with strategic oscillation for the quadratic minimum spanning tree

✍ Lozano, Manuel; Glover, Fred; García-Martínez, Carlos; Rodríguez, Francisco Javi 📂 Article 📅 2014 🏛 Taylor and Francis Group 🌐 English ⚖ 161 KB

Combining evolution with credit apportio

Combining evolution with credit apportionment: A new learning algorithm for neural nets

✍ Robert Smalz; Michael Conrad 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 972 KB