你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada Combinatorial Methods for String Processing
Type
Physical Book
Publisher
Language
English
Pages
124
Format
Hardcover
Dimensions
24.4x17x1.1 cm
Weight
0.48 kg.
ISBN13
9783036521947

Combinatorial Methods for String Processing

Inenaga, Shunsuke (Author) · Mdpi AG · Hardcover

Combinatorial Methods for String Processing - Inenaga, Shunsuke

New Book Imported to Taiwan
Delivery: 23 Sep - 01 Oct Shipping: 5 to 6 business days.
NT$ 1,474
NT$ 1,474

Synopsis "Combinatorial Methods for String Processing"

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.

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews