KRISHI
ICAR RESEARCH DATA REPOSITORY FOR KNOWLEDGE MANAGEMENT
(An Institutional Publication and Data Inventory Repository)
"Not Available": Please do not remove the default option "Not Available" for the fields where metadata information is not available
"1001-01-01": Date not available or not applicable for filling metadata infromation
"1001-01-01": Date not available or not applicable for filling metadata infromation
Please use this identifier to cite or link to this item:
http://krishi.icar.gov.in/jspui/handle/123456789/44570
Title: | PATRICIA trie based time and memory optimization for fast network motif Search |
Other Titles: | Not Available |
Authors: | Himanshu K. K. Chaturvedi A Bandyopadhyay Sarika Jain |
ICAR Data Use Licennce: | http://krishi.icar.gov.in/PDF/ICAR_Data_Use_Licence.pdf |
Author's Affiliated institute: | Amity Institute of Information Technology, Amity University, Noida, Uttar Pradesh 201313 India ICAR::Indian Agricultural Statistics Research Institute ITRA, Ministry of Communication and Information Technology, New Delhi 110030 India |
Published/ Complete Date: | 2016-09-12 |
Project Code: | Not Available |
Keywords: | Algorithms Bioinformatics Complex networks Data structures Network motifs Optimization PATRICIA |
Publisher: | Indian Journal of Animal Sciences |
Citation: | Himanshu, Chaturvedi, K.K. , Bandopadhyay, A. and Jain, S. (2017). PATRICIA Trie based Time and Memory Optimization for fast Network Motif Search. Indian Journal of Animal Sciences , 87(4), 512-519 |
Series/Report no.: | Not Available; |
Abstract/Description: | Network motif search is useful in uncovering the important functional components of complex networks in biological, chemical, social and other domains. PATCOMP - a PARTICIA based novel approach for network motif search is proposed in this paper. The algorithm of PATCOMP takes benefit of memory compression and speed of PATRICIA trie to store the collection of subgraphs in memory and search them for classification and census of network. The structure of trie nodes and how data structure is developed to use it for counting the subgraphs is also described. PATCOMP was compared with QuateXelero and G-Tries.The main benefit of this approach is significant reduction in memory space requirement particularly for large network motifs with acceptable time performance. The experiments with directed networks like E.coli, yeast, social and electronic validated the advantage of PATCOMP in terms of reduction in memory usage by 2.7-27.7% as compared to QuateXelero for smaller motif sizes (with exceptions of s=6 for E. coli and s=6 for social), and 7.8-38.35% for larger motif sizes. For undirected networks, PATCOMP utilizes less memory by 0.07%-43% (with exception of s=7 for electronic and s=6,8 for dolphin networks). |
Description: | Not Available |
Type(s) of content: | Research Paper |
Sponsors: | Not Available |
Language: | English |
Name of Journal: | Indian Journal of Animal Sciences |
NAAS Rating: | 6.28 |
Volume No.: | 87(4) |
Page Number: | 512-519 |
Name of the Division/Regional Station: | Not Available |
Source, DOI or any other URL: | http://epubs.icar.org.in/ejournal/index.php/IJAnS/article/view/69625 |
URI: | http://epubs.icar.org.in/ejournal/index.php/IJAnS/article/view/69625 http://krishi.icar.gov.in/jspui/handle/123456789/44570 |
Appears in Collections: | AEdu-IASRI-Publication |
Files in This Item:
There are no files associated with this item.
Items in KRISHI are protected by copyright, with all rights reserved, unless otherwise indicated.