Advanced Structures and Compression, Indexing and Text Retrieval Algorithms

Dear Colleagues,

The landmark book “Managing Gigabytes” of Witten, Moffat, and Bell, in 1994, is an early witness of how the need to provide indexed searches on natural language text collections that exceed our storage capacities has been pushing us to develop new technologies for their efficient storage and indexing. Incidentally, the development of the Burrows-Wheeler Transform, published the same year, opened the door to new compressed indexing techniques for general string collections, which started to flourish in the year 2000 with the development of the FM-index and other so-called Compressed Suffix Arrays. About a decade later, mostly driven by the rapid advances in sequencing technologies, new kinds of highly repetitive string collections have emerged, which challenge the compression techniques developed in the past and require novel approaches.

In this special issue, we invite researchers on text retrieval, algorithms, data structures, compression, and information theory, to contribute with their best results on how to encode and index string collections of various kinds (natural language, DNA, general strings) space- and time-efficiently on diverse scenarios (classical, highly-repetitive, other application-dependent situations), thereby providing compressed representations that at the same time enable fast searches and analyses of various sorts (exact or approximate string matching, information retrieval, bioinformatic analyses, etc.). Both theoretical and practical results are welcome, from the development of new techniques (new algorithms, data structures, compressors) to the study of the limits of the problem (lower bounds, entropy measures, combinatorics).

Dr. Susana Ladra
Prof. Dr. Gonzalo Navarro
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

• Text compression
• Text indexing
• Compact data structures
• Repetitive text collections
• Pattern matching
• Document retrieval