Text sparsification via local maxima

被引:0
|
作者
Crescenzi, P
Del Lungo, A
Grossi, R
Lodi, E
Pagli, L
Rossi, G
机构
[1] Univ Florence, Dipartimento Sistemi & Informat, I-50134 Florence, Italy
[2] Univ Siena, Dipartimento Matemat, I-53100 Siena, Italy
[3] Univ Pisa, Dipartimento Informat, I-56125 Pisa, Italy
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we investigate a text sparsification technique based on the identification of local maxima. In particular, we first show that looking for an order of the alphabet symbols that minimizes the number of local maxima in a given string is an NP-hard problem. Successively, we describe how the local maxima sparsification technique can be used to filter the access to unstructured texts. Finally, we experimentally show that this approach can be successfully used in order to create a space efficient index for searching a DNA sequence as quickly as a full index.
引用
收藏
页码:290 / 301
页数:12
相关论文
共 50 条
  • [1] Text sparsification via local maxima
    Crescenzi, P
    Del Lungo, A
    Grossi, R
    Lodi, E
    Pagli, L
    Rossi, G
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 341 - 364
  • [2] Improved Local Computation Algorithm for Set Cover via Sparsification
    Grunau, Christoph
    Mitrovic, Slobodan
    Rubinfeld, Ronitt
    Vakilian, Ali
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2993 - 3011
  • [3] Improved Local Computation Algorithm for Set Cover via Sparsification
    Grunau, Christoph
    Mitrovic, Slobodan
    Rubinfeld, Ronitt
    Vakilian, Ali
    [J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2993 - 3011
  • [4] Local Maxima in ADCOPs via Side Payments
    Vaknin, Yair
    Meisels, Amnon
    [J]. 2021 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2021), 2021, : 376 - 381
  • [5] Improving Short Text Clustering by Similarity Matrix Sparsification
    Rakib, Md Rashadul Hasan
    Jankowska, Magdalena
    Zeh, Norbert
    Milios, Evangelos
    [J]. PROCEEDINGS OF THE ACM SYMPOSIUM ON DOCUMENT ENGINEERING (DOCENG 2018), 2018,
  • [6] Finding text in images via local thresholding
    Gllavata, J
    Ewerth, R
    Freisleben, B
    [J]. PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, 2003, : 539 - 542
  • [7] Spectral Hypergraph Sparsification via Chaining
    Lee, James R.
    [J]. PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 207 - 218
  • [8] Effective Tensor Sketching via Sparsification
    Xia, Dong
    Yuan, Ming
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (02) : 1356 - 1369
  • [9] ON SPECTROGRAM LOCAL MAXIMA
    Flandrin, Patrick
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 3979 - 3983
  • [10] APPROXIMATING NONNNEGATIVE POLYNOMIALS VIA SPECTRAL SPARSIFICATION
    Erguer, Alperen A.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2019, 29 (01) : 852 - 873