TY - JOUR AU - Kashani, Zahra Razaghi Moghadam AU - Ahrabian, Hayedeh AU - Elahi, Elahe AU - Nowzari-Dalini, Abbas AU - Ansari, Elnaz Saberi AU - Asadi, Sahar AU - Mohammadi, Shahin AU - Schreiber, Falk AU - Masoudi-Nejad, Ali PY - 2009 DA - 2009/10/04 TI - Kavosh: a new algorithm for finding network motifs JO - BMC Bioinformatics SP - 318 VL - 10 IS - 1 AB - Complex networks are studied across many fields of science and are particularly important to understand biological processes. Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption and have practically restrictions on the size of motifs. SN - 1471-2105 UR - https://doi.org/10.1186/1471-2105-10-318 DO - 10.1186/1471-2105-10-318 ID - Kashani2009 ER -