有界度最接近系统发育二根问题的近似算法

2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI:10.1109/ICCITECHN.2010.5723821

Md. Ahsanur Rahman, Md. Rafiqul Islam

{"title":"有界度最接近系统发育二根问题的近似算法","authors":"Md. Ahsanur Rahman, Md. Rafiqul Islam","doi":"10.1109/ICCITECHN.2010.5723821","DOIUrl":null,"url":null,"abstract":"The degree Δ-closest phylogenetic 2nd root problem (ΔCPR<inf>2</inf>) is an NP-hard problem concerning phylogenetic tree reconstruction from a graph representing the similarities of the species concerned. Here we present an approximation algorithm for this problem for any fixed Δ > 3. When |V| > 3Δ − 1, our algorithm yields an approximation ratio of max((Δ−2)/α, 2), where α > 1 is a constant whose value depends on the values of |V| and Δ.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"63 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An approximation algorithm for bounded degree closest phylogenetic 2nd root problem\",\"authors\":\"Md. Ahsanur Rahman, Md. Rafiqul Islam\",\"doi\":\"10.1109/ICCITECHN.2010.5723821\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The degree Δ-closest phylogenetic 2nd root problem (ΔCPR<inf>2</inf>) is an NP-hard problem concerning phylogenetic tree reconstruction from a graph representing the similarities of the species concerned. Here we present an approximation algorithm for this problem for any fixed Δ > 3. When |V| > 3Δ − 1, our algorithm yields an approximation ratio of max((Δ−2)/α, 2), where α > 1 is a constant whose value depends on the values of |V| and Δ.\",\"PeriodicalId\":149135,\"journal\":{\"name\":\"2010 13th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"63 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2010.5723821\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2010.5723821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

度Δ-closest系统发育二根问题(ΔCPR2)是一个NP-hard问题，涉及从表示有关物种相似性的图中重建系统发育树。在这里，我们提出了一个近似算法对于任何固定Δ > 3的问题。当|V| > 3Δ−1时，我们的算法产生max((Δ−2)/α， 2)的近似比率，其中α > 1是一个常数，其值取决于|V|和Δ的值。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An approximation algorithm for bounded degree closest phylogenetic 2nd root problem

The degree Δ-closest phylogenetic 2nd root problem (ΔCPR2) is an NP-hard problem concerning phylogenetic tree reconstruction from a graph representing the similarities of the species concerned. Here we present an approximation algorithm for this problem for any fixed Δ > 3. When |V| > 3Δ − 1, our algorithm yields an approximation ratio of max((Δ−2)/α, 2), where α > 1 is a constant whose value depends on the values of |V| and Δ.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 13th International Conference on Computer and Information Technology (ICCIT)

自引率

0.00%

发文量