全部文献期刊学位论文会议报纸专利标准年鉴图书|学者科研项目
中外文文献  中文文献  外文文献
作者:Sharma V. Thankachan , Sriram P. Chockalingam ...
来源:[J].BMC Bioinformatics(IF 3.024), 2017, Vol.18 (8)Springer
摘要:Alignment-free sequence comparison approaches have been garnering increasing interest in various data- and compute-intensive applications such as phylogenetic inference for large-scale sequences. While k -mer based methods are predominantly used in real applications, the average ...
作者:Sharma V. Thankachan , Cansu Tetik ...
来源:[J].BMC Genomics(IF 4.397), 2017, Vol.18 (4)Springer
摘要:Hepatitis C is a major public health problem in the United States and worldwide. Outbreaks of hepatitis C virus (HCV) infections associated with unsafe injection practices, drug diversion, and other exposures to blood are difficult to detect and investigate. Molecular analysis ha...
作者:... Jesper Sindahl Nielsen , Rahul Shah , Sharma V. Thankachan
来源:[J].Algorithmica(IF 0.488), 2017, Vol.78 (2), pp.379-393Springer
摘要:Let \(\mathcal {D} = \{\mathsf {T}_1,\mathsf {T}_2, \ldots ,\mathsf {T}_D\}\) be a collection of D string documents of n characters in total, that are drawn from an alphabet set \(\varSigma =[\sigma ]\) . The top-k document retrieval problem is to preprocess \(\mathcal{D}\) into ...
作者:... Gonzalo Navarro , Rahul Shah , Sharma V. Thankachan
来源:[J].Theoretical Computer Science(IF 0.489), 2019Elsevier
摘要:Abstract(#br)Let D be a collection of string documents of n characters in total. The top-k document retrieval problem is to preprocess D into a data structure that, given a query ( P , k ) , can return the k documents of D most relevant to pattern P . The relevance of a docu...
作者:Gonzalo Navarro , Sharma V. Thankachan
来源:[J].Theoretical Computer Science(IF 0.489), 2016, Vol.638, pp.108-111Elsevier
摘要:Abstract(#br)We study the problem of indexing a text T [ 1 … n ] such that whenever a pattern P [ 1 … p ] and an interval [ α , β ] come as a query, we can report all pairs ( i , j ) of consecutive occurrences of P in T with α ≤ j − i ≤ β . We present an O ( n log ...
作者:... J. Ian Munro , Yakov Nekrich , Sharma V. Thankachan
来源:[J].Theoretical Computer Science(IF 0.489), 2016, Vol.635, pp.94-101Elsevier
摘要:Abstract(#br)In this paper we extend several well-known document listing problems to the case when documents contain a substring that approximately matches the query pattern. We study the scenario when the query string can contain a wildcard symbol that matches any alphabet ...
作者:... J. Ian Munro , Venkatesh Raman , Sharma V. Thankachan
来源:[J].Theoretical Computer Science(IF 0.489), 2014, Vol.557, pp.120-127Elsevier
摘要:Abstract(#br)Text indexing is a fundamental problem in computer science, where the task is to index a given text (string) T [ 1 . . n ] , such that whenever a pattern P [ 1 . . p ] comes as a query, we can efficiently report all those locations where P occurs as a substring ...
作者:... J. Ian Munro , Jesper Sindahl Nielsen , Sharma V. Thankachan
来源:[J].Theoretical Computer Science(IF 0.489), 2015, Vol.582, pp.74-82Elsevier
摘要:Abstract(#br)Let D = { d 1 , d 2 , … , d D } be a collection of D string documents of n characters in total. The two-pattern matching problems ask to index D for answering the following queries efficiently. • Report/count the unique documents containing P 1 and P 2 . • ...
作者:... Hicham El-Zein , J. Ian Munro , Sharma V. Thankachan
来源:[J].Theoretical Computer Science(IF 0.489), 2015, Vol.581, pp.97-101Elsevier
摘要:Abstract(#br)Let S be a set of n points in d dimensions such that each point is assigned a color. Given a query range Q = [ a 1 , b 1 ] × [ a 2 , b 2 ] × … × [ a d , b d ] , the geometric range mode query problem asks to report the most frequent color (i.e., a mode) of ...
作者:Gonzalo Navarro , Sharma V. Thankachan
来源:[J].Theoretical Computer Science(IF 0.489), 2014, Vol.542, pp.83-97Elsevier
摘要:Abstract(#br)We address the problem of indexing a collection D = { T 1 , T 2 , … , T D } of D string documents of total length n , so that we can efficiently answer top - k queries : retrieve k documents most relevant to a pattern P of length p given at query time. There exi...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×