Titre | Minimum multiple characterization of biological data using partially defined boolean formulas |
Type de publication | Communication |
Type | Communication avec actes dans un congrès |
Année | 2012 |
Langue | Anglais |
Date du colloque | 2012 |
Titre du colloque | 27th Annual ACM Symposium on Applied Computing |
Titre des actes ou de la revue | SAC'12 Proceedings |
Pagination | 1399 - 1405 |
Auteur | Chhel, Fabien , Lardeux, Frédéric , Goëffon, Adrien , Saubion, Frédéric |
Pays | Italie |
Editeur | ACM |
Ville | Trente |
ISBN | 978-1-4503-0857-1 |
Mots-clés | boolean characterization, diagnostic tests, formula minimization, NP-hard |
Résumé en anglais | In this paper, we adress a characterization problem coming from plant biology. We consider different groups of experiments, each corresponding to the indentification of a given bacteria with regards to a given set of characters for diagnosis purposes. We have to compute simultaneously a complete minimal set of characterization formulas for each group. We propose two different approaches, based on Boolean functions, that allow us to study the satisfiability and the underlying complexity of this problem. |
Notes | Date du colloque : 03/2012 |
URL de la notice | http://okina.univ-angers.fr/publications/ua4448 |
DOI | 10.1145/2245276.2231998 |
Lien vers le document en ligne |