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

International Conference on Algorithms for Computational Biology最新文献

筛选
英文 中文
New Polynomial-Time Algorithm Around the Scaffolding Problem 围绕脚手架问题的新多项式时间算法
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_2
Tom Davot, A. Chateau, R. Giroudeau, Mathias Weller
{"title":"New Polynomial-Time Algorithm Around the Scaffolding Problem","authors":"Tom Davot, A. Chateau, R. Giroudeau, Mathias Weller","doi":"10.1007/978-3-030-18174-1_2","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_2","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123492686","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
Enumerating Dominant Pathways in Biological Networks by Information Flow Analysis 用信息流分析列举生物网络中的优势通路
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_3
Ozan Kahramanoğulları
{"title":"Enumerating Dominant Pathways in Biological Networks by Information Flow Analysis","authors":"Ozan Kahramanoğulları","doi":"10.1007/978-3-030-18174-1_3","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_3","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124494375","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
Using INC Within Divide-and-Conquer Phylogeny Estimation 在分而治之的系统发育估计中使用INC
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_12
Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi Zhang, Satish Rao, T. Warnow
{"title":"Using INC Within Divide-and-Conquer Phylogeny Estimation","authors":"Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi Zhang, Satish Rao, T. Warnow","doi":"10.1007/978-3-030-18174-1_12","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_12","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121352419","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}
引用次数: 5
New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation 大规模系统发育估计的分治新技术
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_1
T. Warnow
{"title":"New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation","authors":"T. Warnow","doi":"10.1007/978-3-030-18174-1_1","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_1","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128536173","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
Comparing Different Graphlet Measures for Evaluating Network Model Fits to BioGRID PPI Networks 比较不同的Graphlet方法评估网络模型适合于BioGRID PPI网络
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_4
Sridevi Maharaj, Zarin Ohiba, W. Hayes
{"title":"Comparing Different Graphlet Measures for Evaluating Network Model Fits to BioGRID PPI Networks","authors":"Sridevi Maharaj, Zarin Ohiba, W. Hayes","doi":"10.1007/978-3-030-18174-1_4","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_4","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133786495","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
A Uniform Theory of Adequate Subgraphs for the Genome Median, Halving, and Aliquoting Problems 基因组中位数、减半和aliquote问题的适当子图的统一理论
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_7
P. Avdeyev, M. Atamanova, M. Alekseyev
{"title":"A Uniform Theory of Adequate Subgraphs for the Genome Median, Halving, and Aliquoting Problems","authors":"P. Avdeyev, M. Atamanova, M. Alekseyev","doi":"10.1007/978-3-030-18174-1_7","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_7","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502461","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
A Mathematical Model for Enhancer Activation Kinetics During Cell Differentiation 细胞分化过程中增强子活化动力学的数学模型
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_14
K. Nousiainen, Jukka Intosalmi, H. Lähdesmäki
{"title":"A Mathematical Model for Enhancer Activation Kinetics During Cell Differentiation","authors":"K. Nousiainen, Jukka Intosalmi, H. Lähdesmäki","doi":"10.1007/978-3-030-18174-1_14","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_14","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128709360","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
Lightweight Metagenomic Classification via eBWT 基于eBWT的轻量级宏基因组分类
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_8
V. Guerrini, Giovanna Rosone
{"title":"Lightweight Metagenomic Classification via eBWT","authors":"V. Guerrini, Giovanna Rosone","doi":"10.1007/978-3-030-18174-1_8","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_8","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130923902","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}
引用次数: 11
Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots rna的图论划分与伪结的分类
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_5
L. Petingi, T. Schlick
{"title":"Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots","authors":"L. Petingi, T. Schlick","doi":"10.1007/978-3-030-18174-1_5","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_5","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131952047","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
Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance 排序距离的计数排序场景和中间基因组
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_10
J. P. P. Zanetti, L. Chindelevitch, J. Meidanis
{"title":"Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance","authors":"J. P. P. Zanetti, L. Chindelevitch, J. Meidanis","doi":"10.1007/978-3-030-18174-1_10","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_10","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115804777","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学术官方微信