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

International Conference on Algorithms for Computational Biology最新文献

筛选
英文 中文
Counting, Generating and Sampling Tree Alignments 计数，生成和采样树对齐
International Conference on Algorithms for Computational Biology Pub Date : 2015-05-22 DOI: 10.1007/978-3-319-38827-4_5
C. Chauve, J. Courtiel, Yann Ponty
{"title":"Counting, Generating and Sampling Tree Alignments","authors":"C. Chauve, J. Courtiel, Yann Ponty","doi":"10.1007/978-3-319-38827-4_5","DOIUrl":"https://doi.org/10.1007/978-3-319-38827-4_5","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124278891","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
Hybrid Genetic Algorithm and Lasso Test Approach for Inferring Well Supported Phylogenetic Trees Based on Subsets of Chloroplastic Core Genes 基于叶绿体核心基因子集推断良好支持系统发育树的混合遗传算法和套索测试方法
International Conference on Algorithms for Computational Biology Pub Date : 2015-04-20 DOI: 10.1007/978-3-319-21233-3_7
Bassam AlKindy, C. Guyeux, Jean-François Couchot, M. Salomon, C. Parisod, J. Bahi
{"title":"Hybrid Genetic Algorithm and Lasso Test Approach for Inferring Well Supported Phylogenetic Trees Based on Subsets of Chloroplastic Core Genes","authors":"Bassam AlKindy, C. Guyeux, Jean-François Couchot, M. Salomon, C. Parisod, J. Bahi","doi":"10.1007/978-3-319-21233-3_7","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_7","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116968116","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
Generalized Hultman Numbers and the Distribution of Multi-break Distances 广义Hultman数与多重断裂距离的分布
International Conference on Algorithms for Computational Biology Pub Date : 2015-03-18 DOI: 10.1007/978-3-319-21233-3_1
N. Alexeev, Anna Pologova, M. Alekseyev
{"title":"Generalized Hultman Numbers and the Distribution of Multi-break Distances","authors":"N. Alexeev, Anna Pologova, M. Alekseyev","doi":"10.1007/978-3-319-21233-3_1","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_1","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125889983","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
Convolutional LSTM Networks for Subcellular Localization of Proteins 卷积LSTM网络用于蛋白质亚细胞定位
International Conference on Algorithms for Computational Biology Pub Date : 2015-03-06 DOI: 10.1007/978-3-319-21233-3_6
Søren Kaae Sønderby, C. Sønderby, H. Nielsen, O. Winther
{"title":"Convolutional LSTM Networks for Subcellular Localization of Proteins","authors":"Søren Kaae Sønderby, C. Sønderby, H. Nielsen, O. Winther","doi":"10.1007/978-3-319-21233-3_6","DOIUrl":"https://doi.org/10.1007/978-3-319-21233-3_6","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128301840","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}
引用次数: 134
Inference of Boolean Networks from Gene Interaction Graphs Using a SAT Solver 利用SAT求解器从基因相互作用图中推断布尔网络
International Conference on Algorithms for Computational Biology Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07953-0_19
D. Rosenblueth, Stalin Muñoz, Miguel Carrillo, E. Azpeitia
{"title":"Inference of Boolean Networks from Gene Interaction Graphs Using a SAT Solver","authors":"D. Rosenblueth, Stalin Muñoz, Miguel Carrillo, E. Azpeitia","doi":"10.1007/978-3-319-07953-0_19","DOIUrl":"https://doi.org/10.1007/978-3-319-07953-0_19","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125339874","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
SVEM: A Structural Variant Estimation Method Using Multi-mapped Reads on Breakpoints 基于断点多映射读的结构变量估计方法
International Conference on Algorithms for Computational Biology Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07953-0_17
Tomohiko Ohtsuki, Naoki Nariai, Kaname Kojima, Takahiro Mimori, Yukuto Sato, Y. Kawai, Y. Yamaguchi-Kabata, T. Shibuya, Masao Nagasaki
{"title":"SVEM: A Structural Variant Estimation Method Using Multi-mapped Reads on Breakpoints","authors":"Tomohiko Ohtsuki, Naoki Nariai, Kaname Kojima, Takahiro Mimori, Yukuto Sato, Y. Kawai, Y. Yamaguchi-Kabata, T. Shibuya, Masao Nagasaki","doi":"10.1007/978-3-319-07953-0_17","DOIUrl":"https://doi.org/10.1007/978-3-319-07953-0_17","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114365305","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
Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS Reads 原始NGS读取反转断点的非映射和非汇编发现
International Conference on Algorithms for Computational Biology Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07953-0_10
C. Lemaitre, Liviu Ciortuz, P. Peterlongo
{"title":"Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS Reads","authors":"C. Lemaitre, Liviu Ciortuz, P. Peterlongo","doi":"10.1007/978-3-319-07953-0_10","DOIUrl":"https://doi.org/10.1007/978-3-319-07953-0_10","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128038623","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}
引用次数: 13
Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations 带符号排列上长度加权反转排序问题的启发式研究
International Conference on Algorithms for Computational Biology Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07953-0_5
T. Arruda, Ulisses Dias, Zanoni Dias
{"title":"Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations","authors":"T. Arruda, Ulisses Dias, Zanoni Dias","doi":"10.1007/978-3-319-07953-0_5","DOIUrl":"https://doi.org/10.1007/978-3-319-07953-0_5","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126567220","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}
引用次数: 7
Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network 高效枚举大分子网络的所有连通诱导子图
International Conference on Algorithms for Computational Biology Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07953-0_14
Sean Maxwell, M. Chance, Mehmet Koyutürk
{"title":"Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network","authors":"Sean Maxwell, M. Chance, Mehmet Koyutürk","doi":"10.1007/978-3-319-07953-0_14","DOIUrl":"https://doi.org/10.1007/978-3-319-07953-0_14","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128753138","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}
引用次数: 26
HapMonster: A Statistically Unified Approach for Variant Calling and Haplotyping Based on Phase-Informative Reads HapMonster:基于相位信息读取的变异召唤和单倍型统计统一方法
International Conference on Algorithms for Computational Biology Pub Date : 2014-07-01 DOI: 10.1007/978-3-319-07953-0_9
Kaname Kojima, Naoki Nariai, Takahiro Mimori, Y. Yamaguchi-Kabata, Yukuto Sato, Y. Kawai, Masao Nagasaki
{"title":"HapMonster: A Statistically Unified Approach for Variant Calling and Haplotyping Based on Phase-Informative Reads","authors":"Kaname Kojima, Naoki Nariai, Takahiro Mimori, Y. Yamaguchi-Kabata, Yukuto Sato, Y. Kawai, Masao Nagasaki","doi":"10.1007/978-3-319-07953-0_9","DOIUrl":"https://doi.org/10.1007/978-3-319-07953-0_9","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116010046","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
首页 上一页 下一页 尾页
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学术官方微信