发布求助
文献互助 智能选刊 最新文献

International Conference on Algorithms for Computational Biology最新文献

筛选
英文 中文
Bootstrapping Algorithms for Gene Duplication and Speciation Events 基因复制和物种形成事件的自举算法
International Conference on Algorithms for Computational Biology Pub Date : 2016-06-21 DOI: 10.1007/978-3-319-38827-4_9
Agnieszka Mykowiecka, P. Górecki
{"title":"Bootstrapping Algorithms for Gene Duplication and Speciation Events","authors":"Agnieszka Mykowiecka, P. Górecki","doi":"10.1007/978-3-319-38827-4_9","DOIUrl":"https://doi.org/10.1007/978-3-319-38827-4_9","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126234092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Robustness of the Parsimonious Reconciliation Method in Cophylogeny 同源发育中简约调和方法的鲁棒性
International Conference on Algorithms for Computational Biology Pub Date : 2016-06-21 DOI: 10.1007/978-3-319-38827-4_10
Laura Urbini, B. Sinaimeri, Catherine Matias, M. Sagot
{"title":"Robustness of the Parsimonious Reconciliation Method in Cophylogeny","authors":"Laura Urbini, B. Sinaimeri, Catherine Matias, M. Sagot","doi":"10.1007/978-3-319-38827-4_10","DOIUrl":"https://doi.org/10.1007/978-3-319-38827-4_10","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132787811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
The Trees in the Peaks 山峰上的树
International Conference on Algorithms for Computational Biology Pub Date : 2016-06-21 DOI: 10.1007/978-3-319-38827-4_1
D. Sankoff, Chunfang Zheng, E. Lyons, Haibao Tang
{"title":"The Trees in the Peaks","authors":"D. Sankoff, Chunfang Zheng, E. Lyons, Haibao Tang","doi":"10.1007/978-3-319-38827-4_1","DOIUrl":"https://doi.org/10.1007/978-3-319-38827-4_1","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133643117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Sorting with Forbidden Intermediates 使用禁止中间体排序
International Conference on Algorithms for Computational Biology Pub Date : 2016-02-19 DOI: 10.1007/978-3-319-38827-4_11
Carlo Comin, A. Labarre, Romeo Rizzi, Stéphane Vialette
{"title":"Sorting with Forbidden Intermediates","authors":"Carlo Comin, A. Labarre, Romeo Rizzi, Stéphane Vialette","doi":"10.1007/978-3-319-38827-4_11","DOIUrl":"https://doi.org/10.1007/978-3-319-38827-4_11","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121149985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Implicit Transpositions in Shortest DCJ Scenarios 最短DCJ场景中的隐式换位
International Conference on Algorithms for Computational Biology Pub Date : 2015-08-04 DOI: 10.1007/978-3-319-21233-3_2
Shuai Jiang, M. Alekseyev
{"title":"Implicit Transpositions in Shortest DCJ Scenarios","authors":"Shuai Jiang, M. Alekseyev","doi":"10.1007/978-3-319-21233-3_2","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_2","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115813862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
P2RANK: Knowledge-Based Ligand Binding Site Prediction Using Aggregated Local Features P2RANK:基于知识的配体结合位点预测
International Conference on Algorithms for Computational Biology Pub Date : 2015-08-04 DOI: 10.1007/978-3-319-21233-3_4
Radoslav Krivák, D. Hoksza
{"title":"P2RANK: Knowledge-Based Ligand Binding Site Prediction Using Aggregated Local Features","authors":"Radoslav Krivák, D. Hoksza","doi":"10.1007/978-3-319-21233-3_4","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_4","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129031785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Constraint-Based Genetic Compilation 基于约束的遗传编译
International Conference on Algorithms for Computational Biology Pub Date : 2015-08-04 DOI: 10.1007/978-3-319-21233-3_3
Christophe Ladroue, Sara Kalvala
{"title":"Constraint-Based Genetic Compilation","authors":"Christophe Ladroue, Sara Kalvala","doi":"10.1007/978-3-319-21233-3_3","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_3","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Likelihood-Based Inference of Phylogenetic Networks from Sequence Data by PhyloDAG 基于似然的PhyloDAG序列数据系统发育网络推断
International Conference on Algorithms for Computational Biology Pub Date : 2015-08-04 DOI: 10.1007/978-3-319-21233-3_10
Quan Nguyen, Teemu Roos
{"title":"Likelihood-Based Inference of Phylogenetic Networks from Sequence Data by PhyloDAG","authors":"Quan Nguyen, Teemu Roos","doi":"10.1007/978-3-319-21233-3_10","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_10","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125985493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs 流-一种基于流的动态图中图案计数算法
International Conference on Algorithms for Computational Biology Pub Date : 2015-08-04 DOI: 10.1007/978-3-319-21233-3_5
Benjamin Schiller, S. Jager, K. Hamacher, T. Strufe
{"title":"StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs","authors":"Benjamin Schiller, S. Jager, K. Hamacher, T. Strufe","doi":"10.1007/978-3-319-21233-3_5","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_5","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116129592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver 用sat -求解器从多个系统发育树构建简约杂交网络
International Conference on Algorithms for Computational Biology Pub Date : 2015-08-04 DOI: 10.1007/978-3-319-21233-3_11
V. Ulyantsev, M. Melnik
{"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":"https://doi.org/10.1007/978-3-319-21233-3_11","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126191561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信