{"doi":"10.1007/978-3-642-40453-5_16","title":"Unifying Parsimonious Tree Reconciliation","abstract":null,"journal":"Lecture Notes in Computer Science","year":2013,"id":45158,"datarank":0.29188652235829704,"base_score":1.9459101490553132,"endowment":1.9459101490553132,"self_citation_contribution":0.29188652235829704,"citation_network_contribution":0.0,"self_endowment_contribution":0.29188652235829704,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":6,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":1,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":211390,"name":"Matthias Bernt","orcid":null,"position":1,"is_corresponding":false},{"id":211391,"name":"Martin Middendorf","orcid":null,"position":2,"is_corresponding":false},{"id":211389,"name":"Nicolas Wieseke","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":0.0,"endowment":0.0,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W2221768568","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.16670751,"influential_citations":0,"citation_trend":[],"oa_status":"green","license":null,"oa_locations":[{"url":"https://arxiv.org/pdf/1307.7831","host_type":"repository"},{"url":"https://arxiv.org/pdf/1307.7831","host_type":"repository"},{"url":"http://link.springer.com/content/pdf/10.1007/978-3-642-40453-5_16","host_type":"publisher"},{"url":"http://arxiv.org/abs/1307.7831","host_type":"repository"},{"url":"https://doi.org/10.1007/978-3-642-40453-5_16","host_type":"book series"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.745.6751","host_type":""},{"url":"https://doi.org/10.48550/arxiv.1307.7831","host_type":"repository"}],"fields_of_study":["Genomics and Phylogenetic Studies","Mycorrhizal Fungi and Plant Interactions","Evolution and Genetic Dynamics","Mathematics","Computer Science","Biology"],"mesh_terms":[],"keywords":["Phylogenetic tree","Tree (set theory)","Heuristic","Tree rearrangement","Computer science","Set (abstract data type)","Event (particle physics)","Theoretical computer science","Biology","Artificial intelligence","Mathematics","Combinatorics","Gene"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Life in Land"}],"linked_datasets":[{"doi":"10.4230/lipics.wabi.2021.3","title":"Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-02T03:29:00.910204Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}