Error-tolerance pooling designs based on Johnson graphs

DOI10.1007/S11590-012-0585-2MaRDI QIDQ2448188zbMATH OpenOpenAlexFDO

Authors Benjian Lv, Kaishun Wang, Jun Guo

Publication date 30 April 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-012-0585-2

zbMATH Keywords

disjunct matrixerror-toleranceJohnson graphpooling design

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Error-correcting pooling designs associated with some distance-regular graphs
• scientific article; zbMATH DE number 6288915
• Error-tolerance pooling design in a finite vector space.
• A construction of pooling designs with surprisingly high degree of error correction
• A new family of pooling designs.

Cites work

• A construction of pooling designs with surprisingly high degree of error correction
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• Error-correcting pooling designs associated with some distance-regular graphs
• scientific article; zbMATH DE number 5262869 (Why is no real title available?)
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Pooling designs with surprisingly high degree of error correction in a finite vector space
• Pooling spaces and non-adaptive pooling designs
• Test case generators and computational results for the maximum clique problem

Cited in

(4)

• Optimal pooling designs with error detection
• Two new error-correcting pooling designs from d-bounded distance-regular graphs
• Improvements on some error-tolerance pooling designs
• Error-correcting pooling designs associated with some distance-regular graphs

This page was built for publication: Error-tolerance pooling designs based on Johnson graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448188)