Faster Computation of Genome Mappability

Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics Pub Date : 2018-08-15 DOI:10.1145/3233547.3233645

Sahar Hooshmand, Paniz Abedin, Daniel Gibney, S. Aluru, Sharma V. Thankachan

{"title":"Faster Computation of Genome Mappability","authors":"Sahar Hooshmand, Paniz Abedin, Daniel Gibney, S. Aluru, Sharma V. Thankachan","doi":"10.1145/3233547.3233645","DOIUrl":null,"url":null,"abstract":"\\beginthebibliography 1 \\bibitemalzamel2017faster M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, and W.-K. Sung. \\newblock Faster algorithms for 1-mappability of a sequence. \\newblock In \\em International Conference on Combinatorial Optimization and Applications, pages 109--121. Springer, 2017. \\bibitemderrien2012fast T. Derrien, J. Estellé, S. M. Sola, D. G. Knowles, E. Raineri, R. Guigó, and P. Ribeca. \\newblock Fast computation and applications of genome mappability. \\newblock \\em PloS one, 7(1):e30377, 2012. \\bibitemThankachanACA18 S. V. Thankachan, C. Aluru, S. P. Chockalingam, and S. Aluru. \\newblock Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis. \\newblock In \\em Research in Computational Molecular Biology - 22nd Annual International Conference, RECOMB 2018, Paris, France, April 21-24, 2018, Proceedings, pages 211--224, 2018. \\endthebibliography","PeriodicalId":131906,"journal":{"name":"Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3233547.3233645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

\beginthebibliography 1 \bibitemalzamel2017faster M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, and W.-K. Sung. \newblock Faster algorithms for 1-mappability of a sequence. \newblock In \em International Conference on Combinatorial Optimization and Applications, pages 109--121. Springer, 2017. \bibitemderrien2012fast T. Derrien, J. Estellé, S. M. Sola, D. G. Knowles, E. Raineri, R. Guigó, and P. Ribeca. \newblock Fast computation and applications of genome mappability. \newblock \em PloS one, 7(1):e30377, 2012. \bibitemThankachanACA18 S. V. Thankachan, C. Aluru, S. P. Chockalingam, and S. Aluru. \newblock Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis. \newblock In \em Research in Computational Molecular Biology - 22nd Annual International Conference, RECOMB 2018, Paris, France, April 21-24, 2018, Proceedings, pages 211--224, 2018. \endthebibliography

查看原文本刊更多论文

基因组可绘制性的快速计算

M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski，和w - k。唱。序列1-映射的更快算法。《组合优化与应用国际会议》，第109—121页。施普林格,2017年。[bibitemderria]， J. estell， S. M. Sola, D. G. Knowles, E. Raineri, R. Guigó和P. Ribeca。基因组图谱的快速计算和应用。\newblock \em电子科学学报，7(1):393 - 397,2012。S. V. Thankachan, C. Aluru, S. P. Chockalingam, S. Aluru。newblock算法框架在有界编辑下的近似匹配与序列分析应用。计算分子生物学研究-第22届国际会议，RECOMB 2018，法国巴黎，2018年4月21日至24日，论文集，211—224页，2018。\ endthebibliography

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics

自引率

0.00%

发文量