Combinatorial Methods for String Processing

ISBN 10: 3036521941 / ISBN 13: 9783036521947

Published by MDPI AG, 2021

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - Strings, or sequences, are the most fundamental form of digital data. Due to recent developments in sensor network technologies and semi-automated machine-to- machine (M2M) communications, sequential data have been increasing more rapidly than ever. It is o5en the case that such semi-automatically generated sequential data contain abundant repetitive structures. Thus, understanding, revealing, and utilizing combinatorial objects that reside in strings are of great significance in designing efficient string processing algorithms and data structures. Typical topics of interests include (but are not limited to): - Combinatorial string problems and solutions; - Pattern matching algorithms; - Applied combinatorics on words; - Text compression; - Data structures for strings, labeled trees, and compressed text. This Special Issue contains five peer-reviewed papers.

Seller Inventory # 9783036521947

Bibliographic Details

• Title: Combinatorial Methods for String Processing
• Publisher: MDPI AG
• Publication Date: 2021
• Language: English
• ISBN 10: 3036521941
• ISBN 13: 9783036521947
• Binding: Buch
• Condition: Neu
• Dimensions: 250W x 175H x 13D millimeters 250 millimeters width by 175 millimeters height by 13 millimeters depth
• Weight: 510 grams

About this title

Synopsis

Strings, or sequences, are the most fundamental form of digital data. Due to recent developments in sensor network technologies and semi-automated machine-to- machine (M2M) communications, sequential data have been increasing more rapidly than ever. It is o5en the case that such semi-automatically generated sequential data contain abundant repetitive structures. Thus, understanding, revealing, and utilizing combinatorial objects that reside in strings are of great significance in designing efficient string processing algorithms and data structures. Typical topics of interests include (but are not limited to): - Combinatorial string problems and solutions; - Pattern matching algorithms; - Applied combinatorics on words; - Text compression; - Data structures for strings, labeled trees, and compressed text. This Special Issue contains five peer-reviewed papers.