Zobrazeno 1 - 4
of 4
pro vyhledávání: '"MHAMDI, Amel"'
Autor:
Abrieux, Antoine1, Mhamdi, Amel1, Rabhi, Kaouther K.1, Egon, Julie1, Debernard, Stéphane2, Duportets, Line2,3, Tricoire-Leignel, Hélène1, Anton, Sylvia1, Gadenne, Christophe1 christophe.gadenne@inra.fr
Publikováno v:
PLoS ONE. 11/30/2016, Vol. 11 Issue 11, p1-15. 15p.
Publikováno v:
Actes des Douzièmes Journées Francophones de Programmation par Contraintes
JFPC 2016 Douzièmes Journées Francophones de Programmation par Contraintes
JFPC 2016 Douzièmes Journées Francophones de Programmation par Contraintes, Jan 2016, Montpellier, France
JFPC 2016 Douzièmes Journées Francophones de Programmation par Contraintes
JFPC 2016 Douzièmes Journées Francophones de Programmation par Contraintes, Jan 2016, Montpellier, France
The classification of objects relative to a similarity or a given distance is a central problem in computational biology. Several well-known classification algorithms, such as partitioning problem of similar genes, are based on the transformation of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::33a5ea86af2af2cee984851e9de7d6a9
https://hal.archives-ouvertes.fr/hal-02051483
https://hal.archives-ouvertes.fr/hal-02051483
Autor:
Mhamdi Amel, Naanaa Wady
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319075921
DCAI
DCAI
Given a graph G = (S,E), the problem dealt with in this paper consists in partitioning S into a disjoint union of cliques by adding or removing a minimum number z(G) of edges. The problem, which is refered to by the Zahn Problem (ZP), is NP-hard in g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18ca29c36b4638e5b7febed028db110a
https://doi.org/10.1007/978-3-319-07593-8_59
https://doi.org/10.1007/978-3-319-07593-8_59
Autor:
Maraoui, Raoudha, Mhamdi, Amel, Graiet, Mohamed, Kmimech, Mourad, Bhiri, Mohamed Tahar, Gaaloul, Walid, Cariou, Eric
Publikováno v:
Proceedings of the 13th International Conference: Information Integration & Web-based Applications & Services; Dec2011, p349-352, 4p