{"title":"Cooperative Rec-I-DCM3: A Population-Based Approach for Reconstructing Phylogenies","authors":"T. Williams, Marc L. Smith","doi":"10.1109/CIBCB.2005.1594908","DOIUrl":null,"url":null,"abstract":"In this paper, we study the use of cooperation as a technique for designing faster algorithms for reconstructing phylogenetic trees. Our focus is on the use of cooperation to reconstruct trees based on maximum parsimony. Our baseline algorithm is Rec-I-DCM3, the best-performing MP algorithm known-to-date. Our results demonstrate that cooperation does improve the performance of the baseline algorithm by at least an order of magnitude in terms of running time. The use of cooperation also established a new best known score on one of our datasets.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBCB.2005.1594908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we study the use of cooperation as a technique for designing faster algorithms for reconstructing phylogenetic trees. Our focus is on the use of cooperation to reconstruct trees based on maximum parsimony. Our baseline algorithm is Rec-I-DCM3, the best-performing MP algorithm known-to-date. Our results demonstrate that cooperation does improve the performance of the baseline algorithm by at least an order of magnitude in terms of running time. The use of cooperation also established a new best known score on one of our datasets.