skip to main content
10.1145/1982185.1982213acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

The bacterial strains characterization problem

Published:21 March 2011Publication History

ABSTRACT

The accurate characterization of collections of bacterial strains is a major scientific challenge, since bacteria are indeed responsible of significant plant diseases and thus subjected to official control procedures (e.g., in Europe, Directive 2000/29/EC). The development of diagnostic tests is therefore an important issue in order to routinely identify strains of these species.

References

  1. P. Descamps and M. Véron. Une méthode de choix des caractères d'identification basée sur le théorème de bayes et la mesure de l'information. Ann. Microbiol. (Paris), 132B, 1981.Google ScholarGoogle Scholar
  2. B. Duval and J.-K. Hao. Advances in metaheuristics for gene selection and classification of microarray data. Briefings in Bioinformatics, 11(1): 127--141, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  3. R. Gavaldà and D. Thérien. An algebraic perspective on boolean function learning. In Algorithmic Learning Theory, 20th International Conference, ALT 2009, Porto, Portugal, October 3--5, 2009. Proceedings, volume 5809 of Lecture Notes in Computer Science, pages 201--215. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Hajri, C. Brin, G. Hunault, F. Lardeux, C. Lemaire, C. Manceau, T. Boureau, and S. Poussier. A "repertoire for repertoire" hypothesis: Repertoires of type three effectors are candidate determinants of host specificity in xanthomonas. PLoS ONE, 4(8): e6632, 08 2009.Google ScholarGoogle ScholarCross RefCross Ref
  5. J. Hlavička and P. Fišer. Boom: a heuristic boolean minimizer. In ICCAD '01: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, pages 439--442, Piscataway, NJ, USA, 2001. IEEE Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. McCluskey. Minimization of boolean functions. Bell System Tech. J, 35: 1417--1444, 1956.Google ScholarGoogle ScholarCross RefCross Ref
  7. P. McGeer, J. Sanghavi, R. Brayton, and A. S. Vincentelli. Espresso-signature: a new exact minimizer for logic functions. In DAC '93: Proceedings of the 30th international Design Automation Conference, pages 618--624, New York, NY, USA, 1993. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. D. Meyer, F. Leisch, and K. Hornik. The support vector machine under test. Neurocomputing, 55(1--2): 169--186, 2003.Google ScholarGoogle Scholar
  9. B. K. Natarajan. On learning boolean functions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 296--304. ACM, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. V. Quine. A way to simplify truth functions. American Mathematics Society Monthly, 59(8): 521--531, 1952.Google ScholarGoogle ScholarCross RefCross Ref
  11. J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5: 239--266, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. Umans. The minimum equivalent DNF problem and shortest implicants. J. Comput. Syst. Sci., 63(4): 597--611, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11): 1134--1142, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. N. Zhang, D. M. Geiser, and C. D. Smart. Macroarray detection of solanaceous plant pathogens in the fusarium solani species complex. Plant Disease, 91(12): 1612--1620, 2007.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. The bacterial strains characterization problem

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing
          March 2011
          1868 pages
          ISBN:9781450301138
          DOI:10.1145/1982185

          Copyright © 2011 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 21 March 2011

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • poster

          Acceptance Rates

          Overall Acceptance Rate1,650of6,669submissions,25%
        • Article Metrics

          • Downloads (Last 12 months)1
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader