Anthony J. Macula

According to our database1, Anthony J. Macula authored at least 33 papers between 1996 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
DNA codes for nonadditive stem similarity.
Probl. Inf. Transm., 2014

Two Models of Nonadaptive Group Testing for Designing Screening Experiments.
CoRR, 2014

2012
Comparison of different methods to analyze a DNA computing library using the polymerase chain reaction.
Nat. Comput., 2012

2010
On critical relative distance of DNA codes for additive stem similarity.
Proceedings of the IEEE International Symposium on Information Theory, 2010

A Better Bouncer's Algorithm.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
Successful preparation and analysis of a 5-site 2-variable DNA library.
Nat. Comput., 2009

Pcr Nonadaptive Group Testing of DNA Libraries for Biomolecular Computing and Taggant Applications.
Discret. Math. Algorithms Appl., 2009

2008
Hypothesis group testing for disjoint pairs.
J. Comb. Optim., 2008

New, Improved, and Practical k-Stem Sequence Similarity Measures for Probe Design.
J. Comput. Biol., 2008

Random Coding Bounds for DNA codes based on Fibonacci ensembles of DNA sequences.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Group Testing to Annihilate Pairs Applied to DNA Cross-Hybridization Elimination Using SYBR Green I.
J. Comput. Biol., 2007

Free Energy Gap and Statistical Thermodynamic Fidelity of DNA Codes.
J. Comput. Biol., 2007

DNA Codes Based on Stem Similarities Between DNA Sequences.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006
Remark on "On DNA Codes" published in <i>Probl. Peredachi Inf.</i>, 2005, no. 4.
Probl. Inf. Transm., 2006

New t-Gap Insertion-Deletion-Like Metrics for DNA Hybridization Thermodynamic Modeling.
J. Comput. Biol., 2006

2005
On DNA Codes.
Probl. Inf. Transm., 2005

A Construction of Pooling Designs with Some Happy Surprises.
J. Comput. Biol., 2005

New results on DNA codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Experimental Validation of DNA Sequences for DNA Computing: Use of a SYBR Green I Assay.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Trivial two-stage group testing for complexes using almost disjunct matrices.
Discret. Appl. Math., 2004

A group testing method for finding patterns in data.
Discret. Appl. Math., 2004

A Weighted Insertion-Deletion Stacked Pair Thermodynamic Metric for DNA Codes.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

2003
Trivial Two-Stage Group Testing with High Error Rates.
J. Comb. Optim., 2003

Exordium for DNA Codes.
J. Comb. Optim., 2003

2002
Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others.
J. Comb. Theory A, 2002

2000
New constructions of superimposed codes.
IEEE Trans. Inf. Theory, 2000

1999
On the probability that subset sequences are minimal.
Discret. Math., 1999

An Analysis of the Lines in the Three Dimensional Affine Space Over F3.
Ars Comb., 1999

Two-stage group testing for complexes in the presence of errors.
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

1998
Group Testing with Relatively Small Pools and DNA Library Screening.
J. Comb. Optim., 1998

1997
Two applications of separating systems to nonadaptive procedures.
Discret. Math., 1997

Error-correcting Nonadaptive Group Testing with d<sup>e</sup>-disjunct Matrices.
Discret. Appl. Math., 1997

1996
A simple construction of d-disjunct matrices with certain constant weights.
Discret. Math., 1996


  Loading...