We use MASTIFF to compute the weight of Minimum Spanning Forest (MST) of MS-BioGraphs while ignoring self-edges of the graphs. – MS1 Using machine with 24 cores. MSF weight: 109,915,787,546 – MS50 Using machine with 128 cores. MSF weight: 416,318,200,808 MS-BioGraphsRelated Posts Technical Posts LaganLighter
biological networks
17 posts
30th International European Conference on Parallel and Distributed Computing (Euro-Par 2024) DOI: 10.1007/978-3-031-69583-4_7PDF Version Abstract The Maximum Weighted Clique(MWC) problem remains challenging due to its unfavourable time complexity.In this paper, we analyze the execution of exact search-based MWC algorithms and show that high-accuracy weighted cliques can be discovered in the […]
MS-BioGraph sequence similarity graph datasets are now publicly available on IEEE DataPort: https://doi.org/10.21227/gmd9-1534 . To access the files, you need to register/login to IEEE DataPort and then visit the MS-BioGraphs page. By saving the page as an HTML file such as dp.html, you may download the datasets (as an example […]
ParaGrapher source code has been integrated to LaganLighter and access to different WebGraph formats are available in LaganLighter: For further details, please refer to – LaganLighter source coder Repository: https://github.com/DIPSA-QUB/LaganLighter, particularly, the graph.c file.– ParaGrapher source code repository: https://github.com/DIPSA-QUB/ParaGrapher particularly, the src/webgraph.c and src/WG*.java files. Read more about ParaGrapher and […]
ParaGrapher source code for accessing WebGraphs have been published. The supported graph types are: ParaGrapher uses its asynchronous and parallel API to implement these graph types. The user needs to implement a callback function that is called by the API upon completion of reading a block of edges. Poplar uses […]
2023 IEEE International Conference on Big Data (BigData’23)December 15-18, 2023, Sorrento, Italia DOI: 10.1109/BigData59044.2023.10386309PDF (Authors Copy) Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, and realistic data sets. To ensure continuation of this progress, we (i) investigate […]
2023 IEEE International Symposium on Workload Characterization (IISWC’23)October 1-3, 2023, Ghent, Belgium DOI: 10.1109/IISWC59245.2023.00029PDF Version Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, and realistic data sets. In this paper, we announce publication of MS-BioGraphs, a new […]
DOI: 10.48550/arXiv.2308.16744 PDF VersionarXiv Link Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, and realistic data sets. To ensure continuation of this progress, we (i) investigate and optimize the process of generating large sequence similarity graphs as […]
Name MS-BioGraphs – MS URL https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-MS Download Link https://doi.org/10.21227/gmd9-1534 Script for Downloading All Files https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-on-IEEE-DataPort/ Validating and Sample Code https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-Validation/ Graph Explanation Vertices represent proteins and each edge represents the sequence similarity between its two endpoints Edge Weighted Yes Directed No Number of Vertices 1,757,323,526 Number of Edges 2,488,069,027,875 Maximum […]
Name MS-BioGraphs – MSA500 URL https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-MSA500 Download Link https://doi.org/10.21227/gmd9-1534 Script for Downloading All Files https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-on-IEEE-DataPort/ Validating and Sample Code https://blogs.qub.ac.uk/DIPSA/MS-BioGraphs-Validation/ Graph Explanation Vertices represent proteins and each edge represents the sequence similarity between its two endpoints Edge Weighted Yes Directed Yes Number of Vertices 1,757,323,526 Number of Edges 1,244,904,754,157 Maximum […]