{"title":"祖先-后代距离下的共识树是NP-Hard的。","authors":"Yuanyuan Qi, Mohammed El-Kebir","doi":"10.1089/cmb.2023.0262","DOIUrl":null,"url":null,"abstract":"<p><p><b>Due to uncertainty in tumor phylogeny inference from sequencing data, many methods infer multiple, equally plausible phylogenies for the same cancer. To summarize the solution space</b> <math><mstyle></mstyle><mi>T</mi></math> <b>of tumor phylogenies, consensus tree methods seek a single best representative tree</b> <i>S</i> <b>under a specified pairwise tree distance function. One such distance function is the ancestor-descendant (AD) distance</b> <i>[Formula: see text]</i> <b>, which equals the size of the symmetric difference of the transitive closures of the edge sets <i>[Formula: see text]</i> and <i>[Formula: see text]</i> . Here, we show that finding a consensus tree</b> <i>S</i> <b>for tumor phylogenies</b> <math><mstyle></mstyle><mi>T</mi></math> <b>that minimizes the total AD distance <i>[Formula: see text]</i> is NP-hard.</b></p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"58-70"},"PeriodicalIF":1.4000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Consensus Tree Under the Ancestor-Descendant Distance is NP-Hard.\",\"authors\":\"Yuanyuan Qi, Mohammed El-Kebir\",\"doi\":\"10.1089/cmb.2023.0262\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p><b>Due to uncertainty in tumor phylogeny inference from sequencing data, many methods infer multiple, equally plausible phylogenies for the same cancer. To summarize the solution space</b> <math><mstyle></mstyle><mi>T</mi></math> <b>of tumor phylogenies, consensus tree methods seek a single best representative tree</b> <i>S</i> <b>under a specified pairwise tree distance function. One such distance function is the ancestor-descendant (AD) distance</b> <i>[Formula: see text]</i> <b>, which equals the size of the symmetric difference of the transitive closures of the edge sets <i>[Formula: see text]</i> and <i>[Formula: see text]</i> . Here, we show that finding a consensus tree</b> <i>S</i> <b>for tumor phylogenies</b> <math><mstyle></mstyle><mi>T</mi></math> <b>that minimizes the total AD distance <i>[Formula: see text]</i> is NP-hard.</b></p>\",\"PeriodicalId\":15526,\"journal\":{\"name\":\"Journal of Computational Biology\",\"volume\":\" \",\"pages\":\"58-70\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Biology\",\"FirstCategoryId\":\"99\",\"ListUrlMain\":\"https://doi.org/10.1089/cmb.2023.0262\",\"RegionNum\":4,\"RegionCategory\":\"生物学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2023/11/28 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q4\",\"JCRName\":\"BIOCHEMICAL RESEARCH METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Biology","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1089/cmb.2023.0262","RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/11/28 0:00:00","PubModel":"Epub","JCR":"Q4","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
Consensus Tree Under the Ancestor-Descendant Distance is NP-Hard.
Due to uncertainty in tumor phylogeny inference from sequencing data, many methods infer multiple, equally plausible phylogenies for the same cancer. To summarize the solution spaceof tumor phylogenies, consensus tree methods seek a single best representative treeSunder a specified pairwise tree distance function. One such distance function is the ancestor-descendant (AD) distance[Formula: see text], which equals the size of the symmetric difference of the transitive closures of the edge sets [Formula: see text] and [Formula: see text] . Here, we show that finding a consensus treeSfor tumor phylogeniesthat minimizes the total AD distance [Formula: see text] is NP-hard.
期刊介绍:
Journal of Computational Biology is the leading peer-reviewed journal in computational biology and bioinformatics, publishing in-depth statistical, mathematical, and computational analysis of methods, as well as their practical impact. Available only online, this is an essential journal for scientists and students who want to keep abreast of developments in bioinformatics.
Journal of Computational Biology coverage includes:
-Genomics
-Mathematical modeling and simulation
-Distributed and parallel biological computing
-Designing biological databases
-Pattern matching and pattern detection
-Linking disparate databases and data
-New tools for computational biology
-Relational and object-oriented database technology for bioinformatics
-Biological expert system design and use
-Reasoning by analogy, hypothesis formation, and testing by machine
-Management of biological databases