祖先-后代距离下的共识树是NP-Hard的。

IF 1.4 4区 生物学 Q4 BIOCHEMICAL RESEARCH METHODS
Journal of Computational Biology Pub Date : 2024-01-01 Epub Date: 2023-11-28 DOI:10.1089/cmb.2023.0262
Yuanyuan Qi, Mohammed El-Kebir
{"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}
引用次数: 0

摘要

由于从测序数据推断肿瘤系统发育的不确定性,许多方法推断出同一种癌症的多个同样可信的系统发育。为了总结肿瘤系统发育的解空间T,共识树方法在指定的两两树距离函数下寻求单个最佳代表树S。一个这样的距离函数是祖先-后代(AD)距离[公式:见文],它等于边集[公式:见文]和[公式:见文]的传递闭包的对称差的大小。在这里,我们证明了找到肿瘤系统发育T的共识树S,使总AD距离∑T∈Td(S,T)最小是np困难的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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 space T of tumor phylogenies, consensus tree methods seek a single best representative tree S under 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 tree S for tumor phylogenies T that minimizes the total AD distance [Formula: see text] is NP-hard.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computational Biology
Journal of Computational Biology 生物-计算机:跨学科应用
CiteScore
3.60
自引率
5.90%
发文量
113
审稿时长
6-12 weeks
期刊介绍: 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
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信