✦ LIBER ✦

Construction of Large Sets of Clones

✍ Scribed by J. Demetrovics; L. Hannák

Book ID: 102484392
Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 386 KB
Volume: 33
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19870330207

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Construction of Large Sets of Idempo

The Construction of Large Sets of Idempotent Quasigroups

✍ Teirlinck, Luc; Lindner, C.C. 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Construction of Large Sets of Pairwise D

Construction of Large Sets of Pairwise Disjoint Transitive Triple Systems

✍ Lindner, C.C.; Street, Anne Penfold 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 740 KB

Construction of a Bovine Genomic Library

Construction of a Bovine Genomic Library of Large Yeast Artificial Chromosome Clones

✍ F. Libert; A. Lefort; R. Okimoto; J. Womack; M. Georges 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Tripling Construction for Large Sets of

Tripling Construction for Large Sets of Resolvable Directed Triple Systems

✍ Jun Ling Zhou; Yan Xun Chang 📂 Article 📅 2005 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 173 KB

Iterative Dictionary Construction for Co

Iterative Dictionary Construction for Compression of Large DNA Data Sets

✍ Kuruppu, S.; Beresford-Smith, B.; Conway, T.; Zobel, J. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 989 KB

Construction of large sets of pairwise d

Construction of large sets of pairwise disjoint transitive triple systems II

✍ C.C Lindner 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 563 KB

The maximum number of pairwise disjoint transitive triple systems (T'I'Ss) of order n is 3(n -2). Such a collection is called a large set of pairwise disjoint TI'Ss of order n. The main result in this paper is the proof of the following theorem: If n -1 or 5 (rood 6), and there exists a large set of