String Processing and Information Retrieval

DOI10.1007/B14038zbMath1254.68119OpenAlexW4299547039MaRDI QIDQ5897136

Antonio Fariña, María F. Esteller, Nieves R. Brisaboa, Gonzalo Navarro

Publication date: 9 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b14038

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (13)

Compressed matching for feature vectors ⋮ Accelerating Boyer-Moore searches on binary texts ⋮ A general compression algorithm that supports fast searching ⋮ Random access to Fibonacci encoded files ⋮ Towards efficient positional inverted index ⋮ Accelerating Boyer Moore Searches on Binary Texts ⋮ Compressed matching in dictionaries ⋮ Practical fixed length Lempel-Ziv coding ⋮ Huffman coding with non-sorted frequencies ⋮ ODC: frame for definition of dense codes ⋮ Bicriteria Data Compression ⋮ New bounds on \(D\)-ary optimal codes ⋮ An efficient variable-to-fixed length encoding using multiplexed parse trees

This page was built for publication: String Processing and Information Retrieval