{"id":17010954,"url":"https://github.com/simonlarsen/faithmcs","last_synced_at":"2025-03-22T13:20:20.724Z","repository":{"id":138047831,"uuid":"80417376","full_name":"SimonLarsen/faithmcs","owner":"SimonLarsen","description":"Fast iterative local search algorithm for multiple MCS detection","archived":false,"fork":false,"pushed_at":"2017-05-01T20:22:04.000Z","size":72,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-27T12:48:05.753Z","etag":null,"topics":["maximum-common-subgraph","mces","mcs","network-alignment","network-analysis"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SimonLarsen.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-01-30T11:55:33.000Z","updated_at":"2024-02-21T02:05:55.000Z","dependencies_parsed_at":null,"dependency_job_id":"8b2772c0-98e0-43c8-ac2b-b387d508689a","html_url":"https://github.com/SimonLarsen/faithmcs","commit_stats":{"total_commits":29,"total_committers":1,"mean_commits":29.0,"dds":0.0,"last_synced_commit":"8937404b3010264f8d24965e1654dd80d30f17c1"},"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimonLarsen%2Ffaithmcs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimonLarsen%2Ffaithmcs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimonLarsen%2Ffaithmcs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimonLarsen%2Ffaithmcs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SimonLarsen","download_url":"https://codeload.github.com/SimonLarsen/faithmcs/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244959885,"owners_count":20538709,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["maximum-common-subgraph","mces","mcs","network-alignment","network-analysis"],"created_at":"2024-10-14T06:05:52.529Z","updated_at":"2025-03-22T13:20:20.689Z","avatar_url":"https://github.com/SimonLarsen.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"faithMCS\n========\n\nA fast iterative local search heuristic algorithm for multiple maximum common edge subgraph detection and network alignment.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsimonlarsen%2Ffaithmcs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsimonlarsen%2Ffaithmcs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsimonlarsen%2Ffaithmcs/lists"}