Direct pattern matching on compressed text

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207)

• Publication date

  1998-09-09

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/SPIRE.1998.712987
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• String Matching in Lempel—Ziv Compressed Strings

  1998cited by this paper
• An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions

  1997cited by this paper
• Multiple Approximate String Matching

  1997cited by this paper
• Large text searching allowing errors

  1997cited by this paper
• Indexing Compressed Text

  1997cited by this paper
• A Faster Algorithm for Approximate String Matching

  1996cited by this paper
• Eecient Algorithms for Lempel-ziv Encoding

  1996cited by this paper
• Efficient algorithms for Lempel-Ziv encoding

  1996cited by this paper
• Overview of the Third Text REtrieval Conference (TREC-3)

  1995cited by this paper
• Adding compression to a full‐text retrieval system

  1995cited by this paper
• GLIMPSE: A Tool to Search Through Entire File Systems

  1994influential reference
• Let sleeping files lie: pattern matching in Z-compressed files

  1994cited by this paper
• A text compression scheme that allows fast searching directly in the compressed file

  1994cited by this paper
• Fast text searching: allowing errors

  1992influential reference
• Efficient two-dimensional compressed matching

  1992cited by this paper
• A very fast substring search algorithm

  1990cited by this paper
• Word‐based text compression

  1989cited by this paper
• A Locally Adaptive Data

  1986cited by this paper
• Information retrieval, computational and theoretical aspects

  1978cited by this paper
• On the Complexity of Finite Sequences

  1976cited by this paper
• A method for the construction of minimum-redundancy codes

  1952cited by this paper

• The Many Qualities of a New Directly Accessible Compression Scheme

  2023cites this paper
• An Novel Text Extraction Technique Based on Pattern Matching and Automatic Backtracking

  2021cites this paper
• A Method to Improve Exact Matching Results in Compressed Text using Parallel Wavelet Tree

  2021cites this paper
• Pattern Matching in Hu(cid:11)man

  2020cites this paper
• On the Use of Quasiorders in Formal Language Theory

  2020cites this paper
• Fast Pattern Matching in Compressed Text using Wavelet Tree

  2018cites this paper
• DNA SEQUENCE COMPRESSION BASED ON SUBSTITUTION TECHNIQUE

  2017cites this paper
• Enhanced Algorithms for Compressed Pattern Matching using Wavelet Tree and Bit-parallelism

  2017cites this paper
• An efficient approach towards compressed parameterized word matching using wavelet tree

  2016cites this paper
• METİN VERİLERDE DİZGİ EŞLEME VE SIKIŞTIRILMIŞ DİZGİ EŞLEME İŞLEMLERİ ARASINDAKİ PERFORMANS FARKLARININ İNCELENMESİ

  2016cites this paper
• Fast parameterized word matching on compressed text

  2014cites this paper
• Efficient multi-word parameterized matching on compressed text

  2014cites this paper
• Analyzing the performance differences between pattern matching and compressed pattern matching on texts

  2013cites this paper
• DNA COMPRESSED AND SEQUENCE SEARCHING ON MULTICORE

  2012cites this paper
• New Computational Approaches For Multiple Rna Alignment And Rna Search

  2009cites this paper
• Modeling Text Databases and Its Application to the Web

  2008influential citation
• Adding Compression toBlock Addressing Inverted Indices

  2008influential citation
• Fast Searching on Compressed Text Allowing

  2008cites this paper
• Evaluating DNA sequence searching algorithms on multicore

  2008cites this paper
• Fast Matching Method for DNA Sequences

  2007cites this paper
• Methodology for Evaluating DNA Pattern Searching Algorithms on Multiprocessor

  2007cites this paper
• Fast search in DNA sequence databases using punctuation and indexing

  2006cites this paper
• Modeling Text Databases

  2005cites this paper
• Compressed pattern matching in DNA sequences

  2004cites this paper
• Collage system: a unifying framework for compressed pattern matching

  2003cites this paper
• Adding compression to next-generation text retrieval systems

  2003cites this paper
• A New Compression Method for Compressed Matching EXTENDED

  2002cites this paper
• UmbrellaDB: heterogeneous data source access using a virtual database architecture

  2002cites this paper
• String pattern matching for a deluge survival kit

  2002cites this paper
• Pattern matching in Huffman encoded texts

  2001cites this paper
• Fast and flexible word searching on compressed text

  2000cites this paper
• A new compression method for compressed matching

  2000cites this paper
• Compressed and fully compressed pattern matching in one and two dimensions

  2000cites this paper
• Chapter 1 STRING PATTERN MATCHING FORA DELUGE SURVIVAL

  2000cites this paper
• Speeding Up Pattern Matching by Text Compression

  2000cites this paper
• A Boyer-Moore Type Algorithm for Compressed Pattern Matching

  2000cites this paper
• Pattern Matching in Text Compressed by Using Antidictionaries

  1999cites this paper
• Algorithms on Compressed Strings and Arrays

  1999cites this paper
• A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text

  1999cites this paper
• Linear time sorting of skewed distributions

  1999cites this paper
• Byte Pair Encoding: a Text Compression Scheme That Accelerates Pattern Matching

  1999cites this paper
• A unifying framework for compressed pattern matching

  1999cites this paper
• Fast searching on compressed text allowing errors

  1998cites this paper
• Block addressing indices for approximate text retrieval

  1997cites this paper