V. M. Megler, D. Maier, D. Bottomly, Libbey White, S. McWeeney, B. Wilmot
{"title":"Data Like This: Ranked Search of Genomic Data Vision Paper","authors":"V. M. Megler, D. Maier, D. Bottomly, Libbey White, S. McWeeney, B. Wilmot","doi":"10.1145/2795218.2795221","DOIUrl":null,"url":null,"abstract":"High-throughput genetic sequencing produces the ultimate \"big data\": a human genome sequence contains more than 3B base pairs, and more and more characteristics, or annotations, are being recorded at the base-pair level. Locating areas of interest within the genome is a challenge for researchers, limiting their investigations. We describe our vision of adapting \"big data\" ranked search to the problem of searching the genome. Our goal is to make searching for data as easy for scientists as searching the Internet.","PeriodicalId":211132,"journal":{"name":"Proceedings of the Second International Workshop on Exploratory Search in Databases and the Web","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Second International Workshop on Exploratory Search in Databases and the Web","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2795218.2795221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
High-throughput genetic sequencing produces the ultimate "big data": a human genome sequence contains more than 3B base pairs, and more and more characteristics, or annotations, are being recorded at the base-pair level. Locating areas of interest within the genome is a challenge for researchers, limiting their investigations. We describe our vision of adapting "big data" ranked search to the problem of searching the genome. Our goal is to make searching for data as easy for scientists as searching the Internet.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
