Document retrieval is one of the best established information retrieval activities since the sixties, pervading all search engines. Its aim is to obtain, from a collection of text documents, those most relevant to a pattern query. Current technology is mostly oriented to “natural language” text collections, where inverted indexes are the preferred solution. As successful as this paradigm has been, it fails to properly handle various East Asian languages and other scenarios where the “natural language ” assumptions do not hold. In this survey we cover the recent research in extending the document retrieval techniques to a broader class of sequence collections, which has applications in bioinformatics, data and Web mining, chemoinformatics, s...
Text search engines return a set of k documents ranked by similarity to a query. Typically, document...
Abstract. How to exploit structured information to facilitate document retrieval? There have been qu...
We address the problem of indexing a collectionD = {T1,T2,...TD} of D string documents of total leng...
Artículo de publicación ISIDocument retrieval is one of the best-established information retrieval a...
Colored range queries are a well-studied topic in computational geometry and database research that,...
This thesis surveys use of graph theory and algorithms in information retrieval. It provides an intr...
We propose and explore a novel approach,called the se- quence model,to text retrieval.The model di ff...
Interested in how an efficient search engine works? Want to know what algorithms are used to rank re...
Wavelet trees are widely used in the representation of sequences, permutations, text collections, bi...
The levels-of-processing theory proposes that there are many ways to process and code information. T...
The present chapter describes a few standard algorithms used for processing texts. They apply, for.....
Includes bibliographical references (pages 179-190) and index.Book fair 2013.viii, 192 pages :"This ...
Let D = {d_1, d_2, ...} be a collection of string documents of n characters in total, which are draw...
Abstract. Document retrieval aims at finding the most important doc-uments where a pattern appears i...
We survey the major techniques for information retrieval. In the first part, we provide an overview...
Text search engines return a set of k documents ranked by similarity to a query. Typically, document...
Abstract. How to exploit structured information to facilitate document retrieval? There have been qu...
We address the problem of indexing a collectionD = {T1,T2,...TD} of D string documents of total leng...
Artículo de publicación ISIDocument retrieval is one of the best-established information retrieval a...
Colored range queries are a well-studied topic in computational geometry and database research that,...
This thesis surveys use of graph theory and algorithms in information retrieval. It provides an intr...
We propose and explore a novel approach,called the se- quence model,to text retrieval.The model di ff...
Interested in how an efficient search engine works? Want to know what algorithms are used to rank re...
Wavelet trees are widely used in the representation of sequences, permutations, text collections, bi...
The levels-of-processing theory proposes that there are many ways to process and code information. T...
The present chapter describes a few standard algorithms used for processing texts. They apply, for.....
Includes bibliographical references (pages 179-190) and index.Book fair 2013.viii, 192 pages :"This ...
Let D = {d_1, d_2, ...} be a collection of string documents of n characters in total, which are draw...
Abstract. Document retrieval aims at finding the most important doc-uments where a pattern appears i...
We survey the major techniques for information retrieval. In the first part, we provide an overview...
Text search engines return a set of k documents ranked by similarity to a query. Typically, document...
Abstract. How to exploit structured information to facilitate document retrieval? There have been qu...
We address the problem of indexing a collectionD = {T1,T2,...TD} of D string documents of total leng...