Trending Bestseller

Combinatorial Methods for String Processing

No reviews yet Write a Review
Hardback
31 October 2021
RRP: $77.43
$73.95
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

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.

You Can Find This Title In

    Product Details
    ISBN-13
    9783036521947
    Publisher
    MDPI AG
    Published
    31 October 2021
    Format
    Hardback

    This product hasn't received any reviews yet. Be the first to review this product!

    RRP: $77.43
    $73.95
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Combinatorial Methods for String Processing

    RRP: $77.43
    $73.95

    Description

    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.

    You Can Find This Title In

      This Title Is Categorised As