{"title":"Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver","authors":"V. Ulyantsev, M. Melnik","doi":"10.1007/978-3-319-21233-3_11","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Algorithms for Computational Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-21233-3_11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
