Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2

In this paper, we construct two classes of t × n , s e -disjunct matrix with subspaces in orthogonal space of characteristic 2 and exhibit their disjunct properties. We also prove that the test efficiency t / n of constructions II is smaller than that of D’yachkov et al. (J. Comput. Biol. 12:1129–11...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 20; číslo 4; s. 325 - 334
Hlavní autori:	Li, Zengti, Gao, Suogang, Du, Hongjie, Zou, Feng, Wu, Weili
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.11.2010 Springer Science + Business Media Springer
Predmet:	Algebra Applied sciences Combinatorics Convex and Discrete Geometry Exact sciences and technology Field theory and polynomials Flows in networks. Combinatorial problems Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Probability and statistics Sampling theory, sample surveys Sciences and techniques of general use Statistics Theory of Computation Pooling design disjunct matrix Orthogonal space Group testing algorithm Finite field s Vector space Group testing Error correction Test efficiency
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	In this paper, we construct two classes of t × n , s e -disjunct matrix with subspaces in orthogonal space of characteristic 2 and exhibit their disjunct properties. We also prove that the test efficiency t / n of constructions II is smaller than that of D’yachkov et al. (J. Comput. Biol. 12:1129–1136, 2005 ).
ISSN:	1382-6905 1573-2886
DOI:	10.1007/s10878-009-9210-4