Papers
Topics
Authors
Recent
Search
2000 character limit reached

Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics

Published 11 May 2024 in cs.IT and math.IT | (2405.06870v1)

Abstract: Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of λ\lambda-{\sf ADD}-codes, studying such codes with certain distance dd and codelength nn. When dd is constant, we provide explicit code constructions with rates close to $1/2$. When dd is proportional to nn, we provide a GV-type lower bound whose rates are efficiently computable. Upper bounds for such codes are also studied.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. R. Dorfman, “The detection of defective members of large populations,” The Annals of mathematical statistics, vol. 14, no. 4, pp. 436–440, 1943.
  2. H. S. Shapiro and N. Fine, “E1399,” The American Mathematical Monthly, vol. 67, no. 7, pp. 697–698, 1960.
  3. P. Erdos and A. Rényi, “On two problems of information theory,” Magyar Tud. Akad. Mat. Kutató Int. Közl, vol. 8, no. 1-2, pp. 229–243, 1963.
  4. A. G. D’yachkov, “Lectures on designing screening experiments,” arXiv preprint arXiv:1401.7505, 2014.
  5. V. Guruswami and H.-P. Wang, “Noise-resilient group testing with order-optimal tests and fast-and-reliable decoding,” arXiv preprint arXiv:2311.08283, 2023.
  6. M. Aldridge, O. Johnson, J. Scarlett et al., “Group testing: an information theory perspective,” Foundations and Trends® in Communications and Information Theory, vol. 15, no. 3-4, pp. 196–392, 2019.
  7. A. Emad and O. Milenkovic, “Semiquantitative group testing,” IEEE Transactions on Information Theory, vol. 60, no. 8, pp. 4614–4636, 2014.
  8. M. A. Sheikh, O. Milenkovic, and R. G. Baraniuk, “Designing compressive sensing dna microarrays,” in 2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2007, pp. 141–144.
  9. N. Shental, A. Amir, and O. Zuk, “Identification of rare alleles and their carriers using compressed se (que) nsing,” Nucleic acids research, vol. 38, no. 19, pp. e179–e179, 2010.
  10. J. J. L. Goh, N. Chou, W. Y. Seow, N. Ha, C. P. P. Cheng, Y.-C. Chang, Z. W. Zhao, and K. H. Chen, “Highly specific multiplexed rna imaging in tissues with split-fish,” Nature methods, vol. 17, no. 7, pp. 689–693, 2020.
  11. M. Cheraghchi, “Noise-resilient group testing: Limitations and constructions,” in International Symposium on Fundamentals of Computation Theory.   Springer, 2009, pp. 62–73.
  12. N. H. Bshouty, “On the coin weighing problem with the presence of noise,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, A. Gupta, K. Jansen, J. Rolim, and R. Servedio, Eds.   Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 471–482.
  13. D. Goshkoder, N. Polyanskii, and I. Vorobyev, “Efficient combinatorial group testing: Bridging the gap between union-free and disjunctive codes,” arXiv preprint arXiv:2401.16540, 2024.
  14. P. Erdős, P. Frankl, and Z. Füredi, “Families of finite sets in which no set is covered by the union of r others,” Israel J. Math, vol. 51, no. 1-2, pp. 79–89, 1985.
  15. A. Brouwer, J. Shearer, N. Sloane, and W. Smith, “A new table of constant weight codes,” IEEE Transactions on Information Theory, vol. 36, no. 6, pp. 1334–1380, 1990.
  16. K. O’Bryant, “A complete annotated bibliography of work related to sidon sequences.” The Electronic Journal of Combinatorics [electronic only], vol. DS11, pp. 39 p., electronic only–39 p., electronic only, 2004. [Online]. Available: http://eudml.org/doc/129129
  17. B. Lindström, “Determination of two vectors from the sum,” Journal of Combinatorial Theory, vol. 6, no. 4, pp. 402–407, 1969.
  18. A. G. D’yachkov and V. V. Rykov, “On a coding model for a multiple-access adder channel,” Problemy Peredachi Informatsii, vol. 17, no. 2, pp. 26–38, 1981.
  19. G. S. Poltyrev, “Improved upper bound on the probability of decoding error for codes of complex structure,” Problemy Peredachi Informatsii, vol. 23, no. 4, pp. 5–18, 1987.
  20. L. M. Tolhuizen, “The generalized gilbert-varshamov bound is implied by turan’s theorem [code construction],” IEEE Transactions on Information Theory, vol. 43, no. 5, pp. 1605–1606, 1997.
  21. Y. Caro and Z. Tuza, “Improved lower bounds on k-independence,” Journal of Graph Theory, vol. 15, no. 1, pp. 99–107, 1991.
  22. T. Thiele, “A lower bound on the independence number of arbitrary hypergraphs,” Journal of Graph Theory, vol. 30, no. 3, pp. 213–221, 1999.
  23. B. Csaba, T. A. Plick, and A. Shokoufandeh, “A note on the caro-tuza bound on the independence number of uniform hypergraphs.” Australas. J Comb., vol. 52, pp. 235–242, 2012.
  24. L. Tolhuizen, “A generalisation of the gilbert-varshamov bound and its asymptotic evaluation,” arXiv preprint arXiv:1106.6206, 2011.
  25. R. R. Varshamov, “Estimate of the number of signals in error correcting codes,” Docklady Akad. Nauk, SSSR, vol. 117, pp. 739–741, 1957.
  26. R. Pemantle and M. C. Wilson, “Twenty combinatorial examples of asymptotics derived from multivariate generating functions,” Siam Review, vol. 50, no. 2, pp. 199–272, 2008.
  27. G. Keshav, D. T. Dao, H. Mao Kiah, and M. Kovačević, “Evaluation of the gilbert–varshamov bound using multivariate analytic combinatorics,” in 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 2458–2463.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free