Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 23 for “"text indexing"”.
-
Space and energy efficient molecular programming and space efficient text indexing methods for sequence alignment
… than structure. We design a number of compressed text indexes that improve pattern matching queries in light of common biological events such as single nucleotide polymorphisms in genomes and alternative splicing in transcriptomes. Our text indexes and associated algorithms have the potential for …
-
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
… complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices which occupies minute space (FM-indexes) and wavelet trees. These data structures also can be used to represent labeled trees …
-
CREATING A BIOMEDICAL ONTOLOGY INDEXED SEARCH ENGINE TO IMPROVE THE SEMANTIC RELEVANCE OF RETREIVED MEDICAL TEXT
… MeSH imposes uniformity and consistency in the indexing process, it has been proven that using MeSH indices only result in a small increase in precision over free-text indexing. Moreover, studies have shown that the use of controlled vocabularies in the indexing process is not an effective …
-
Succinct Data Structures
… on the important problem of <i>compressed text indexing<\i>, where the goal is to compress a text document and allow arbitrary searching for patterns in the best possible time <i>without first decompressing the text<\i>. We develop a number of compressed data structures that either solve …
-
Algorithms and Lower Bounds for Ordering Problems on Strings
… lower bounds for a collection of string and text-compression-related problems. These results are unified under the theme of ordering constraint satisfaction. Utilizing the connections to ordering constraint satisfaction, we provide hardness results and algorithms for the following: …
-
Suffix Trees for Document Retrieval
… look at the suitability of Suffix Trees for full text indexing and retrieval. Typically suffix trees are built on a character level, where the tree records which characters follow each other character. By building suffix trees for documents based on words instead of characters, the resulting tree …
-
Indexing gigabyte data (text and images), index construction /
This work presents and evaluates two methods for indexing and searching text and image data of which size can exceed a gigabyte. Indexing is comprised of operations done on a file system in order to get new, changed files and a sequence of data transformation operations which reduce original input …
-
Compressed indexing data structures for biological sequences
As more and more information are generated in the text format from sources like biological research and the internet, the problem of storing and searching within text collections (a.k.a. text indexing) becomes more and more important. This thesis introduces three different indexing data structures …
-
Using Pan-Genomic Data Structures to Incoporate Diversity Into Genomic Analyses
… reference bias through the use of novel text indexing data structures and algorithms that can incorporate such diversity. First, we present data structures built on top of the Run-Length FM Index that can be used to index and query a pan-genome, ie. a representation of the genome that …
-
Efficient Data Structures for Text Processing Applications
… is devoted to designing and analyzing efficient text indexing data structures and associated algorithms for processing text data. The general problem is to preprocess a given text or a collection of texts into a space-efficient index to quickly answer various queries on this data. Basic queries …
-
An Analysis of Document Retrieval and Clustering Using an Effective Semantic Distance Measure
… to organizing and categorizing large amounts of textual information have previously relied on lexical and word based measures to perform grouping or classification tasks. Quite often, however, these processes take place without respect to semantics, or word meanings. This is perhaps due to the …
-
Conceptual, Impact-Based Publications Recommendations
… several features including autonomous citation indexing, automatic metadata extraction, full-text indexing and reference linking. Users are able to retrieve relevant documents from the CiteSeerx database directly using search queries and will further benefit if the system suggests document …
-
Experimenting with automatic concept identification in documents
… are collecting and using large sets of text documents with information on their own operations and their commercial environments, and consequently they are becoming increasingly interested in tools like Automatic Concept Identification to help them manage their data files. This paper …
-
Space-Efficient Data Structures for Information Retrieval
… we present several results on representing textual information and searching in it. In particular, we present text indexes for grammar-based compressed text that support searching for a pattern and extracting substrings of the input text. These are the first general indexes for grammar-based …
-
Scalable Architecture for Integrated Batch and Streaming Analysis of Big Data
… In the storage layer, we reveal that existing text indexing techniques do not work well for the unique queries of social data, which put constraints on both textual content and social context. To address this issue, we propose a flexible indexing framework over NoSQL databases to support fully …
-
Indexing Compressed Text
… rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches of combining them have recently attracted the attention of researchers. In this thesis, we …
-
Semiautomatic recognition of semantic relationships in English technical texts.
When people read a text, they rely on a priori knowledge of language, common sense knowledge and knowledge of the domain. Many natural language processing systems implement this human model of language understanding, and therefore are heavily knowledge-dependent. Such systems assume the …
-
Efficient storage indexing of structured and unsructured data
… or unstructured. Therefore, effective text indexing and search is crucial for data usability and exploration. Moreover, the exploding amount of structured data that needs to be managed and the demanding workloads that include both throughput-oriented batch jobs and latency-sensitive …
-
Approximate string matching for high-throughput sequencing
… the first part of this thesis, I cover practical indexing and filtering methods for exact and approximate string matching. I present state of the art algorithms and data structures, give their pseudocode and discuss their implementation. Furthermore, I provide all implementations within SeqAn, the …
-
Přibližné vyhledávání řetězců v předzpracovaných dokumentech
… které umožňují po jednorazovém předspracování textu velmi rychlé vyhledávaní díky indexu, který si nad textem vytvoří. Nejprve bude definován problém samotný a demonstrována rozmanitost jeho využití, následována krátkým shrnutím rozdílných přístupů k této problematice. Poté budou detailně …
Page 1 of 2