Special Issue "Group Testing"

Quicklinks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (28 February 2014)

Special Issue Editor

Guest Editor
Dr. Mahdi Cheraghchi
MIT Computer Science and Artificial Intelligence Lab, Room G626 32 Vassar Street Cambridge, Massachusetts 02139, USA
Website: http://www.mit.edu/~mahdich
E-Mail: mahdi@csail.mit.edu
Phone: +1 617 253 3796
Fax: +1 617 258 8682
Interests: coding and information theory; pseudorandomness and extractor theory; explicit constructions; complexity theory; sparse recovery; approximation algorithms

Special Issue Information

Dear Colleagues,

This special issue of Algorithms is devoted to combinatorial group testing. As a sub-area of sparse recovery, group testing aims for efficient identification of a number of individuals (known as "positives") within a very large population. This is achieved by a small number of carefully designed "group tests", where each test reveals whether a predetermined set of individuals contains any positives. This simple abstract model can capture surprisingly many problems of theoretical and practical interest, where the population of individuals may correspond to biological samples, data points in a sensor network or a data stream, links or nodes in a large computer network or a social network, etc. In these problems, the naive strategy for collection of information may be prohibitive due to the costs related to preparation of the tests, storage issues of large amounts of data, communication costs, or other resource constraints. This motivates further development of efficient test designs, fast recovery algorithms, novel applications of group testing in practical and theoretical problems, as well as the study of variations of group testing in different models. We hereby invite articles presenting original research on group testing to this special issue and hope to receive many high-quality submissions.

Dr. Mahdi Cheraghchi
Guest Editor

Submission

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed Open Access quarterly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 300 CHF (Swiss Francs). English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.


Published Papers

No papers have been published in this special issue yet.

Last update: 19 September 2013

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert