✦ LIBER ✦

FINDING A COMBINATORIAL ALGORITHM

✍ Scribed by Peter H. Sellers

Book ID: 118717691
Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 216 KB
Volume: 319
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1979.tb32828.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the Right Hybrid Algorithm - A C

Finding the Right Hybrid Algorithm - A Combinatorial Meta-Problem

✍ Joachim Schimpf; Mark Wallace 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 407 KB

Finding the Right Hybrid Algorithm – A C

Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem

✍ Mark Wallace; Joachim Schimpf 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 79 KB

A Combinatorial Algorithm

✍ Easterfield, T. E. 📂 Article 📅 1946 🏛 Oxford University Press 🌐 English ⚖ 202 KB

A combinatorial description of the close

A combinatorial description of the closest tree algorithm for finding evolutionary trees

✍ Michael D. Hendy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 382 KB

The closest tree algorith¢a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va

A Translation Method for Finding Combina

A Translation Method for Finding Combinatorial Bijections

✍ Philip Matchett Wood; Doron Zeilberger 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 336 KB

Combinatorial EM algorithms

✍ Marschner, Ian C. 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 883 KB