Filters








16 Hits in 1.1 sec

DCA Using Suffix Arrays

Martin Fiala, Jan Holub
2008 Data Compression Conference (DCC), Proceedings  
DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by Crochemore et al. [1] .  ...  Once we have the antidictionary constructed the compression as well as the decompression are extremely fast-a simple transducer is used.  ...  DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by Crochemore et al. [1] .  ... 
doi:10.1109/dcc.2008.95 dblp:conf/dcc/FialaH08 fatcat:jrkrxwgqdnfcxo73pcblnuiytu

Text Compression Using Antidictionaries [chapter]

M. Crochemore, F. Mignosi, A. Restivo, S. Salemi
1999 Lecture Notes in Computer Science  
We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for equilibrated binary sources.  ...  A second advantage is a synchronization property that is helpful to search compressed data and to parallelize the compressor.  ...  The advantages of the scheme are: fast at decompressing data, it is similar to a compressor generator (compressor compiler) for xed sources, fast at compressing data for xed sources, it has a synchronization  ... 
doi:10.1007/3-540-48523-6_23 fatcat:ki3gp4bfnzcnnnbdculmaa76sy

Reducing space for index implementation

Maxime Crochemore
2003 Theoretical Computer Science  
As a second method we show that considering a complement language can be useful especially when it is related to data compression.  ...  This article considers several strategies to implement e ciently full indexes on raw textual data.  ...  The DCA method, Data Compression with Antidictionary, is a simple encoding of the text y according to an antidictionary AD for y. It works on a binary alphabet, say A = {a; b}.  ... 
doi:10.1016/s0304-3975(01)00222-5 fatcat:fpufzwwdzfg77gotpq2zawecde

String Pattern Matching for a Deluge Survival Kit [chapter]

Alberto Apostolico, Maxime Crochemore
2002 Massive Computing  
DATA COMPRESSION USING ANTIDICTIONARIES Yet another basic text compression method, called DCA, uses some "negative" information about the text, which is described in terms of antidictionaries [58, 59,  ...  directly on the compressed data.  ... 
doi:10.1007/978-1-4615-0005-6_6 fatcat:zx3uoflljbfs7oyclwxk2ic2ua

Page 7331 of Mathematical Reviews Vol. , Issue 2000j [page]

2000 Mathematical Reviews  
A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression.  ...  Summary: “We give a new text compression scheme based on forbidden words (‘antidictionary’). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time.  ... 

Constructing Antidictionaries of Long Texts in Output-Sensitive Space

Lorraine A.K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis
2020 Theory of Computing Systems  
In data compression, this corresponds to computing the antidictionary of k documents. In bioinformatics, it corresponds to computing words that are absent from a genome of k chromosomes.  ...  In data compression, this scenario corresponds to computing the antidictionary of k documents [12, 13].  ...  Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Data compression using antidictionaries. Proc. IEEE 88(11), 1756–1768 (2000) 13.  ... 
doi:10.1007/s00224-020-10018-5 fatcat:3544avat3vgipkic4katx62nca

Combinatorial Characterization of Formal Languages [article]

Arseny M. Shur
2010 arXiv   pre-print
The main characteristic studied in the dissertation is combinatorial complexity, which is a "counting" function associated with a language and returning the number of words of given length in this language  ...  Formal languages have a number of applications in computer science (programming languages and compilers, software and hardware verification, data compression, cryptography, computer graphics, etc), and  ...  Theorem 7 [ 181 ] 181 Let L i be the FAD-language with the antidictionary M i .  ... 
arXiv:1010.5456v1 fatcat:g7u6h6llcjdqxfjpowplr3e7oq

Compror: On-line lossless data compression with a factor oracle

Arnaud Lefebvre, Thierry Lecroq
2002 Information Processing Letters  
We present in this article a linear time and space data compression method.  ...  This method, based on a factor oracle and the computation of the length of repeated suffixes, is easy to implement, fast and gives good compression ratios.   ...  The experiments were done on a PC running Linux with two 500 MHz processors and 1 GB RAM. The results, given in Fig. 7 , show that compror is a fast method which gives good compression ratios.  ... 
doi:10.1016/s0020-0190(01)00308-8 fatcat:yd6jkmtv6ncwhpjy4tdkyoiyie

An experimental study of a compressed index

Paolo Ferragina, Giovanni Manzini
2001 Information Sciences  
The novelty of that index resides in the careful combination of the compression algorithm proposed by Burrows and Wheeler [6] with the suffix array data structure [16] .  ...  They have mainly investigated the compressed matching problem under various compression schemes: for example LZ77 [8], LZ78 [1], Huffman [19], Antidictionaries [7] .  ...  of gzip (with option -9 for maximum compression) and bzip2 (version 1.0.1).  ... 
doi:10.1016/s0020-0255(01)00098-6 fatcat:4uhhoivyrngzjana3j3nsunk4y

A comparison of BWT approaches to string pattern matching

Andrew Firth, Tim Bell, Amar Mukherjee, Don Adjeroh
2005 Software, Practice & Experience  
This allows the storage requirement of data to be reduced through the exceptionally good compression offered by BWT, while allowing fast access to the information for searching by taking advantage of the  ...  Recently a number of algorithms have been developed to search files compressed with the Burrows-Wheeler Transform (BWT) without the need for full decompression first.  ...  Acknowledgements The authors would like to thank Paolo Ferragina for his help with the FM-index method.  ... 
doi:10.1002/spe.669 fatcat:vzwkjaht3jfnvoywkznlxynspu

Page 1918 of Mathematical Reviews Vol. 32, Issue Index [page]

Mathematical Reviews  
., 2000j:68193 Crochemore, Maxime (with Mignosi, Filippo; Restivo, Antonio; Salemi, Sergio) Text compression using antidictionaries.  ...  ., 2000b:15001 Lisitsa, Alexei (with Sazonov, Vladimir) Bounded hyperset theory and web-like data bases 2000¢:68051 Sazonov, Vladimir see Lisitsa, Alexei, 2000¢e:68051 68U99 None of the above, but in this  ... 

Page 2021 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
Shibata, Yusuke (with Takeda, Masayuki; Shinohara, Ayumi; Arikawa, Setsuo) Pattern matching in text compressed by using antidictionaries.  ...  (English summary) 2002d:68054 Tan, Zhiyi (with He, Yong') Semi-on-line scheduling with ordinal data on two uniform machines. (English summary) 2002f:90045 — see also He, Yong!  ... 

Page 1946 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
(Summary) 2002h:68236 68W05 (68R15, 68W40) — (with Shibata, Yusuke; Shinohara, Ayumi; Arikawa, Setsuo) Pattern matching in text compressed by using antidictionaries. (English summary) J.  ...  (Stephan Dempe) 2002a:90049 90C20 (91A65) — (with Nishino, Hisakazu) On measuring the inefficiency with the inner-product norm in data envelopment analysis. (English summary) European J. Oper.  ... 

Page 74 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
(Summary) 2002h:68235 68W05 (94A08) — (with Shibata, Yusuke; Takeda, Masayuki; Shinohara, Ayumi) Pattern matching in text compressed by using antidictionaries. (English summary) J.  ...  by text compression: the dawn of a new era.  ... 

Un capítulo poco conocido del estudio diccionarístico: La terminografía lexicográfica. Estado y propuestas

Jesús Camacho Niño
2018 Revista de Lexicografía  
In practice, however, there is no hard and fast boundary between factual and lexical knowledge.  ...  ANTIDICTIONARY, REFERENCE PROFESS Iii Index. The Catalogue Shop (Littlewood Order), 1997.  ...  Gove), Springfield MA, 1961 (with Addenda, 1993 .  ... 
doi:10.17979/rlex.2016.22.0.3321 fatcat:f5vmdjukx5h4pki4sulc36aizi
« Previous Showing results 1 — 15 out of 16 results