String Algorithms and Applications

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".

Deadline for manuscript submissions: closed (30 December 2023) | Viewed by 632

Special Issue Editors


E-Mail Website
Guest Editor
Working Group Practical Computer Science, Institute of Computer Science of the University of Münster, 48149 Münster, Germany
Interests: stringology; algorithms and data structures; combinatorics on words; string algorithms
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto 611-0011, Japan
Interests: computational biology; string and tree algorithms; complex networks
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

We are pleased to invite you to submit research to our Special Issue on "String Algorithms and Applications" in Algorithms. The field of string processing has been an active area of research for many years. String processing has been proven to be essential for many applications in computer science and beyond. String algorithms are used in a wide range of areas such as bioinformatics, information retrieval, natural language processing, text mining, and many others.

This Special Issue aims to provide a platform for researchers to present their latest work on string algorithms and their applications. We welcome submissions that focus on the design, analysis, and implementation of algorithms for string processing, text indexes, lossless data compression, algorithm engineering on strings problems, and applications of string algorithms to solve real-world problems.

Contributions may include original research articles, reviews, and surveys. All submitted papers will undergo a rigorous peer-review process, ensuring the highest quality of the research presented. We believe that this Special Issue will provide an opportunity for researchers to exchange ideas and promote the development of string algorithms and their applications.

We encourage you to submit your research to this Special Issue and share your latest findings with the research community. Thank you for your interest! We look forward to receiving submissions.

Dr. Dominik Köppl
Prof. Dr. Tatsuya Akutsu
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.

Keywords

  • string processing
  • text indexes
  • lossless data compression
  • applications of string algorithms
  • algorithm engineering on strings problems

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop