Yifat Felder

Learn More
—A configuration management database (CMDB) can be considered to be a large graph representing the IT infrastructure entities and their interrelationships. Mining such graphs is challenging because they are large, complex, and multi-attributed, and have many repeated labels. These characteristics pose challenges for graph mining algorithms, due to the(More)
A configuration management database (CMDB) can be considered to be a large graph representing the IT infrastructure entities and their interrelationships. Mining such graphs is challenging because they are large, complex, and multi-attributed and have many repeated labels. These characteristics pose challenges for graph mining algorithms, due to the(More)
BACKGROUND Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn about the functional interdependencies between sets of genes and cellular functions and to predict physical interactions. More generally, it can be used for answering fundamental(More)
version on a funder's repository at a funder's request, provided it is not made publicly available until 12 months after publication. Abstract A configuration management database (CMDB) can be considered to be a large graph representing the IT infrastructure entities and their interrelationships. Mining such graphs is challenging because they are large,(More)
Like all articles in BMC journals, this peer-reviewed article was published immediately upon acceptance. It can be downloaded, printed and distributed freely for any purposes (see copyright notice below). which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Background:(More)
This section deals with hardness issues which are related to the Local Co-Evolutionary problem. We show that some versions of the problem are NP-hard, but in practice it seems that the Local Co-Evolutionary problem has a shorter running time than the bi-clustering problem which is highly used in the context of gene expression analysis. Furthermore, we show(More)