An efficient algorithm for group testing with runlength constraints
- 13 September 2024
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 360, 181-187
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Achievable Rates and Algorithms for Group Testing with Runlength Constraints2022
- Group Testing with Runlength Constraints for Topological Molecular Storage2020
- DNA punch cards for storing data on native DNA sequences via enzymatic nickingNature Communications, 2020
- Low-weight superimposed codes and related combinatorial structures: Bounds and applicationsTheoretical Computer Science, 2020
- On the Parameterized Complexity of Pooling DesignJournal of Computational Biology, 2009
- On the upper bounds of the minimum number of rows of disjunct matricesOptimization Letters, 2008
- d-Disjunct matrices: bounds and Lovász Local LemmaDiscrete Mathematics, 2002
- Families of finite sets in which no set is covered by the union ofr othersIsrael Journal of Mathematics, 1985
- Enumerative source encodingIEEE Transactions on Information Theory, 1973
- Nonrandom binary superimposed codesIEEE Transactions on Information Theory, 1964