✦ LIBER ✦

An improved combinatorial biclustering algorithm

✍ Scribed by Ekaterina Nosova, Francesco Napolitano, Roberto Amato…

Book ID: 120913719
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 400 KB
Volume: 22
Category: Article
ISSN: 0941-0643
DOI: 10.1007/s00521-012-0902-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for combinatorial

An improved algorithm for combinatorial multi-parametric quadratic programming

✍ Feller, Christian; Johansen, Tor Arne; Olaru, Sorin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 556 KB

An Improved Combinatorial Algorithm for

An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem

✍ Jatinder N. D. Gupta 📂 Article 📅 1971 🏛 INFORMS 🌐 English ⚖ 203 KB

Query expansion using an immune-inspired

Query expansion using an immune-inspired biclustering algorithm

✍ Pablo A. D. de Castro; Fabrício O. de França; Hamilton M. Ferreira; Guilherme Pa 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 406 KB

Errata: An Improved Combinatorial Algori

Errata: An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem

✍ Jatinder N. D. Gupta 📂 Article 📅 1976 🏛 INFORMS 🌐 English ⚖ 579 KB

Combinatorial Algorithms (An Update) ||

✍ Wilf, Herbert S. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics ⚖ 206 KB

Combinatorial algorithms: an update

✍ Herbert S. Wilf 📂 Library 📅 1987 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 403 KB

This monograph is a survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled gr