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

Annual International Conference on Research in Computational Molecular Biology最新文献

筛选
英文 中文
Modeling Dependence in Evolutionary Inference for Proteins 蛋白质进化推理中的模型依赖
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2018-04-21 DOI: 10.1007/978-3-319-89929-9_8
Gary Larson, J. Thorne, S. Schmidler
{"title":"Modeling Dependence in Evolutionary Inference for Proteins","authors":"Gary Larson, J. Thorne, S. Schmidler","doi":"10.1007/978-3-319-89929-9_8","DOIUrl":"https://doi.org/10.1007/978-3-319-89929-9_8","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128023940","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
Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers 逆向de Bruijn:利用逆向肽合成覆盖所有氨基酸k-mers
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2018-04-21 DOI: 10.1007/978-3-319-89929-9_10
Yaron Orenstein
{"title":"Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers","authors":"Yaron Orenstein","doi":"10.1007/978-3-319-89929-9_10","DOIUrl":"https://doi.org/10.1007/978-3-319-89929-9_10","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122046264","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}
引用次数: 0
GTED: Graph Traversal Edit Distance GTED:图形遍历编辑距离
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2018-04-21 DOI: 10.1007/978-3-319-89929-9_3
A. Boroojeny, Akash Shrestha, A. Sharifi-Zarchi, S. Gallagher, S. C. Sahinalp, H. Chitsaz
{"title":"GTED: Graph Traversal Edit Distance","authors":"A. Boroojeny, Akash Shrestha, A. Sharifi-Zarchi, S. Gallagher, S. C. Sahinalp, H. Chitsaz","doi":"10.1007/978-3-319-89929-9_3","DOIUrl":"https://doi.org/10.1007/978-3-319-89929-9_3","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133389545","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
Long Reads Enable Accurate Estimates of Complexity of Metagenomes 长读取能够准确估计宏基因组的复杂性
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2018-04-21 DOI: 10.1007/978-3-319-89929-9_1
A. Bankevich, P. Pevzner
{"title":"Long Reads Enable Accurate Estimates of Complexity of Metagenomes","authors":"A. Bankevich, P. Pevzner","doi":"10.1007/978-3-319-89929-9_1","DOIUrl":"https://doi.org/10.1007/978-3-319-89929-9_1","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126422379","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
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended 利用最小路径覆盖促进dag动态规划:共线性链扩展
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2017-05-24 DOI: 10.1007/978-3-319-89929-9_7
A. Kuosmanen, Topi Paavilainen, T. Gagie, R. Chikhi, Alexandru I. Tomescu, V. Mäkinen
{"title":"Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended","authors":"A. Kuosmanen, Topi Paavilainen, T. Gagie, R. Chikhi, Alexandru I. Tomescu, V. Mäkinen","doi":"10.1007/978-3-319-89929-9_7","DOIUrl":"https://doi.org/10.1007/978-3-319-89929-9_7","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129827920","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}
引用次数: 14
The Copy-Number Tree Mixture Deconvolution Problem and Applications to Multi-sample Bulk Sequencing Tumor Data 拷贝数树混合反卷积问题及其在多样本肿瘤数据批量测序中的应用
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2017-05-03 DOI: 10.1007/978-3-319-56970-3_20
Simone Zaccaria, M. El-Kebir, G. Klau, Benjamin J. Raphael
{"title":"The Copy-Number Tree Mixture Deconvolution Problem and Applications to Multi-sample Bulk Sequencing Tumor Data","authors":"Simone Zaccaria, M. El-Kebir, G. Klau, Benjamin J. Raphael","doi":"10.1007/978-3-319-56970-3_20","DOIUrl":"https://doi.org/10.1007/978-3-319-56970-3_20","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124068095","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}
引用次数: 17
A Bayesian Active Learning Experimental Design for Inferring Signaling Networks 推理信令网络的贝叶斯主动学习实验设计
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2017-05-03 DOI: 10.1007/978-3-319-56970-3_9
R. Ness, Karen Sachs, Parag Mallick, Olga Vitek
{"title":"A Bayesian Active Learning Experimental Design for Inferring Signaling Networks","authors":"R. Ness, Karen Sachs, Parag Mallick, Olga Vitek","doi":"10.1007/978-3-319-56970-3_9","DOIUrl":"https://doi.org/10.1007/978-3-319-56970-3_9","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122671404","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
Boosting Alignment Accuracy by Adaptive Local Realignment 自适应局部对齐提高对准精度
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2017-05-03 DOI: 10.1007/978-3-319-56970-3_1
Dan F. DeBlasio, J. Kececioglu
{"title":"Boosting Alignment Accuracy by Adaptive Local Realignment","authors":"Dan F. DeBlasio, J. Kececioglu","doi":"10.1007/978-3-319-56970-3_1","DOIUrl":"https://doi.org/10.1007/978-3-319-56970-3_1","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125541000","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
BBK* (Branch and Bound over K*): A Provable and Efficient Ensemble-Based Algorithm to Optimize Stability and Binding Affinity over Large Sequence Spaces BBK* (K*上的分支和定界):一个可证明的基于集成的大序列空间稳定性和绑定亲和力优化算法
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2017-05-03 DOI: 10.1007/978-3-319-56970-3_10
Adegoke A. Ojewole, J. D. Jou, V. Fowler, B. Donald
{"title":"BBK* (Branch and Bound over K*): A Provable and Efficient Ensemble-Based Algorithm to Optimize Stability and Binding Affinity over Large Sequence Spaces","authors":"Adegoke A. Ojewole, J. D. Jou, V. Fowler, B. Donald","doi":"10.1007/978-3-319-56970-3_10","DOIUrl":"https://doi.org/10.1007/978-3-319-56970-3_10","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132968469","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}
引用次数: 6
Dynamic Alignment-Free and Reference-Free Read Compression 动态无对齐和无引用读压缩
Annual International Conference on Research in Computational Molecular Biology Pub Date : 2017-05-03 DOI: 10.1007/978-3-319-56970-3_4
Guillaume Holley, Roland Wittler, Jens Stoye, Faraz Hach
{"title":"Dynamic Alignment-Free and Reference-Free Read Compression","authors":"Guillaume Holley, Roland Wittler, Jens Stoye, Faraz Hach","doi":"10.1007/978-3-319-56970-3_4","DOIUrl":"https://doi.org/10.1007/978-3-319-56970-3_4","url":null,"abstract":"","PeriodicalId":160293,"journal":{"name":"Annual International Conference on Research in Computational Molecular Biology","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123173054","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学术文献互助群
群 号：604180095
Book学术官方微信