{"id":17595207,"url":"https://github.com/dcasella/bsc-thesis","last_synced_at":"2025-09-16T17:46:32.891Z","repository":{"id":74791425,"uuid":"120345966","full_name":"dcasella/bsc-thesis","owner":"dcasella","description":"Bachelor's thesis in Computer Science","archived":false,"fork":false,"pushed_at":"2018-04-02T16:45:59.000Z","size":198,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-07T20:53:04.136Z","etag":null,"topics":["algorithms-implemented","bachelor-thesis","computer-science"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dcasella.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2018-02-05T18:42:37.000Z","updated_at":"2019-10-10T12:27:50.000Z","dependencies_parsed_at":null,"dependency_job_id":"893a5534-b284-4b27-8175-89c1f819d9bf","html_url":"https://github.com/dcasella/bsc-thesis","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/dcasella/bsc-thesis","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dcasella%2Fbsc-thesis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dcasella%2Fbsc-thesis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dcasella%2Fbsc-thesis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dcasella%2Fbsc-thesis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dcasella","download_url":"https://codeload.github.com/dcasella/bsc-thesis/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dcasella%2Fbsc-thesis/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275457688,"owners_count":25468239,"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","status":"online","status_checked_at":"2025-09-16T02:00:10.229Z","response_time":65,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithms-implemented","bachelor-thesis","computer-science"],"created_at":"2024-10-22T07:43:53.129Z","updated_at":"2025-09-16T17:46:32.855Z","avatar_url":"https://github.com/dcasella.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Bachelor of Science thesis in Computer Science\n\n\u003e Thesis work: [Persistent Phylogeny](https://github.com/dcasella/persistent-phylogeny)\n\n## Abstract\n\nRecently, studying character-based phylogeny models that allow the loss of characters gained relevancy.\nE.g., in tumor phylogeny, the deletion of entire genomic regions often cause loss of (previously acquired) mutations.  \nThe Persistent Phylogeny model solves this by generalizing the concept of Perfect Phylogeny, allowing for each character to be acquired and lost at most once during the evolutionary events.  \nWe formalize and contextualize this problem, describing a recently introduced algorithm for reconstructing a Persistent Phylogeny tree starting from a binary matrix, the first solving this problem in polynomial time.  \nWe then proceed to implement it using the C++ language and Boost libraries, complementing the study with tests on instances that do or don't admit a Persistent Phylogeny, and performance evalutation.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdcasella%2Fbsc-thesis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdcasella%2Fbsc-thesis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdcasella%2Fbsc-thesis/lists"}