default search action
Theoretical Computer Science, Volume 812
Volume 812, April 2020
- Gabriele Fici, Giuseppe F. Italiano:
Preface. 1 - Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. 2-12 - M. R. Rani, R. Subashini, Mohith Jagalmohanan:
Simultaneous consecutive ones submatrix and editing problems: Classical complexity and fixed-parameter tractable results. 13-38 - Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed range minimum queries. 39-48 - Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-dimensional maximal repetitions. 49-61 - Gennaro Cordasco, Luisa Gargano, Joseph G. Peters, Adele A. Rescigno, Ugo Vaccaro:
Fast and frugal targeting with incentives. 62-79 - Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
The combinatorics of hidden diversity. 80-95 - Hideo Bannai, Travis Gagie, Tomohiro I:
Refining the r-index. 96-108 - Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Approximate pattern matching on elastic-degenerate text. 109-122 - José Fuentes-Sepúlveda, Gonzalo Navarro, Yakov Nekrich:
Parallel computation of the Burrows Wheeler Transform in compact space. 123-136 - Cheol Ryu, Thierry Lecroq, Kunsoo Park:
Fast string matching for DNA sequences. 137-148 - J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan:
Ranked document selection. 149-159 - Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Efficient computation of longest single-arm-gapped palindromes in a string. 160-173 - Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal reconstruction of a string. 174-186 - Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Linear-time online algorithm for inferring the shortest path graph from a walk label. 187-202 - Ashkan Panahi, Morteza Haghir Chehreghani, Devdatt P. Dubhashi:
Accelerated proximal incremental algorithm schemes for non-strongly convex functions. 203-213 - Lavinia Egidi, Giovanni Manzini:
Lightweight merging of compressed indices based on BWT variants. 214-229 - Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
The Alternating BWT: An algorithmic perspective. 230-243 - Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest property-preserved common factor: A new string-processing framework. 244-251
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.