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

International Conference on Algorithms for Computational Biology最新文献

筛选
英文 中文
Transcript Abundance Estimation and the Laminar Packing Problem 转录物丰度估计与层流填充问题
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_15
A. Rahman, L. Pachter
{"title":"Transcript Abundance Estimation and the Laminar Packing Problem","authors":"A. Rahman, L. Pachter","doi":"10.1007/978-3-030-18174-1_15","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_15","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"47 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":"126884581","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
Efficient Algorithms for Finding Edit-Distance Based Motifs 寻找基于编辑距离的图案的有效算法
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_16
Peng Xiao, Xingyu Cai, S. Rajasekaran
{"title":"Efficient Algorithms for Finding Edit-Distance Based Motifs","authors":"Peng Xiao, Xingyu Cai, S. Rajasekaran","doi":"10.1007/978-3-030-18174-1_16","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_16","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":"129814235","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
MULKSG: MULtiple K Simultaneous Graph Assembly 多K同时图组装
International Conference on Algorithms for Computational Biology Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-18174-1_9
Christopher Wright, S. Krishnamoorthy, Milind Kulkarni
{"title":"MULKSG: MULtiple K Simultaneous Graph Assembly","authors":"Christopher Wright, S. Krishnamoorthy, Milind Kulkarni","doi":"10.1007/978-3-030-18174-1_9","DOIUrl":"https://doi.org/10.1007/978-3-030-18174-1_9","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"7 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":"116842636","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
Consensus Decoding of Recurrent Neural Network Basecallers 递归神经网络基调用器的共识解码
International Conference on Algorithms for Computational Biology Pub Date : 2018-06-25 DOI: 10.1007/978-3-319-91938-6_11
J. Silvestre-Ryan, I. Holmes
{"title":"Consensus Decoding of Recurrent Neural Network Basecallers","authors":"J. Silvestre-Ryan, I. Holmes","doi":"10.1007/978-3-319-91938-6_11","DOIUrl":"https://doi.org/10.1007/978-3-319-91938-6_11","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115576287","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
Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time 线性时间下网状可见网络的树包容问题求解
International Conference on Algorithms for Computational Biology Pub Date : 2018-06-25 DOI: 10.1007/978-3-319-91938-6_3
Andreas D. M. Gunawan
{"title":"Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time","authors":"Andreas D. M. Gunawan","doi":"10.1007/978-3-319-91938-6_3","DOIUrl":"https://doi.org/10.1007/978-3-319-91938-6_3","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123263067","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
Heuristics for the Sorting Signed Permutations by Reversals and Transpositions Problem 有符号排列排序的反转和换位问题的启发式方法
International Conference on Algorithms for Computational Biology Pub Date : 2018-06-25 DOI: 10.1007/978-3-319-91938-6_6
K. L. Brito, A. Oliveira, Ulisses Dias, Zanoni Dias
{"title":"Heuristics for the Sorting Signed Permutations by Reversals and Transpositions Problem","authors":"K. L. Brito, A. Oliveira, Ulisses Dias, Zanoni Dias","doi":"10.1007/978-3-319-91938-6_6","DOIUrl":"https://doi.org/10.1007/978-3-319-91938-6_6","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124815139","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
Algorithms for Analysis and Control of Boolean Networks 布尔网络的分析与控制算法
International Conference on Algorithms for Computational Biology Pub Date : 2018-06-25 DOI: 10.1007/978-3-319-91938-6_1
T. Akutsu
{"title":"Algorithms for Analysis and Control of Boolean Networks","authors":"T. Akutsu","doi":"10.1007/978-3-319-91938-6_1","DOIUrl":"https://doi.org/10.1007/978-3-319-91938-6_1","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133512464","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
Sorting Permutations by Limited-Size Operations 通过有限大小的操作排序排列
International Conference on Algorithms for Computational Biology Pub Date : 2018-06-25 DOI: 10.1007/978-3-319-91938-6_7
Guilherme Henrique Santos Miranda, C. N. Lintzmayer, Zanoni Dias
{"title":"Sorting Permutations by Limited-Size Operations","authors":"Guilherme Henrique Santos Miranda, C. N. Lintzmayer, Zanoni Dias","doi":"10.1007/978-3-319-91938-6_7","DOIUrl":"https://doi.org/10.1007/978-3-319-91938-6_7","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117291391","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
Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations 基于片段加权运算的排列排序近似算法
International Conference on Algorithms for Computational Biology Pub Date : 2018-06-25 DOI: 10.1007/978-3-319-91938-6_5
A. O. Alexandrino, C. N. Lintzmayer, Zanoni Dias
{"title":"Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations","authors":"A. O. Alexandrino, C. N. Lintzmayer, Zanoni Dias","doi":"10.1007/978-3-319-91938-6_5","DOIUrl":"https://doi.org/10.1007/978-3-319-91938-6_5","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120955505","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
Fast Algorithm for Vernier Search of Long Repeats in DNA Sequences with Bounded Error Density 误差密度有限的DNA序列长重复序列游标快速搜索算法
International Conference on Algorithms for Computational Biology Pub Date : 2018-06-25 DOI: 10.1007/978-3-319-91938-6_8
S. P. Tsarev, M. Senashova, M. Sadovsky
{"title":"Fast Algorithm for Vernier Search of Long Repeats in DNA Sequences with Bounded Error Density","authors":"S. P. Tsarev, M. Senashova, M. Sadovsky","doi":"10.1007/978-3-319-91938-6_8","DOIUrl":"https://doi.org/10.1007/978-3-319-91938-6_8","url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126226626","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
首页 上一页 下一页 尾页
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学术官方微信