Ignac, T., Skupin, A., Sakhanenko, N. A., & Galas, D. J. (2014). Discovering pair-wise genetic interactions: an information theory-based approach. PLoS ONE, 9 (3), 92310. doi:10.1371/journal.pone.0092310 Peer Reviewed verified by ORBi |
Galas, D. J., Sakhanenko, N. A., Skupin, A., & Ignac, T. (2014). Describing the complexity of systems: multivariable "set complexity" and the information basis of systems biology. Journal of Computational Biology, 21 (2), 118-40. doi:10.1089/cmb.2013.0039 Peer Reviewed verified by ORBi |
Ignac, T., Sakhanenko, N. A., Skupin, A., & Galas, D. J. (2012). New methods for finding associations in large data sets: Generalizing the maximal information coefficient (MIC). Proceedings of the Ninth International Workshop on Computational Systems Biology, 39-42. Peer reviewed |
Ignac, T., Sakhanenko, N. A., & Galas, D. J. (2012). Complexity of Networks II: The Set Complexity of Edge-Colored Graphs. Complexity, 17 (5), 23-36. doi:10.1002/cplx.21383 Peer Reviewed verified by ORBi |
Ignac, T., Sakhanenko, N., & Galas, D. J. (2012). Relations between the set-complexity and the structure of graphs and their sub-graphs. EURASIP Journal on Bioinformatics and Systems Biology, 13. doi:10.1186/1687-4153-2012-13 Peer reviewed |
Ignac, T., Galas, D. J., & Sakhanenko, N. (2011). RELATION BETWEEN THE SET-COMPLEXITY OF A GRAPH AND ITS STRUCTURE. In Proceedings of the 8th International Workshop on Computational Systems Biology. Peer reviewed |
Ignac, T. (2010). Tree-Based computation in probalistic models [Doctoral thesis, Unilu - University of Luxembourg]. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/15587 |
Ignac, T., & Sorger, U. (2009). Functions on Probabilistic Graphical Models. Proceedings of the International Multiconference on Computer Science and Information Technology IMCSIT 2009. doi:10.1109/IMCSIT.2009.5352794 Peer reviewed |
Seredynski, M., Ignac, T., & Bouvry, P. (2009). Probabilistic Packet Relaying in Wireless Mobile Ad Hoc Network. Parallel Processing and Applied Mathematics. doi:10.1007/978-3-642-14390-8_4 Peer reviewed |