Combinatorial Methods for String Processing
Sold by Books Puddle, New York, NY, U.S.A.
AbeBooks Seller since November 22, 2018
New - Hardcover
Condition: New
Ships within U.S.A.
Quantity: 4 available
Add to basketSold by Books Puddle, New York, NY, U.S.A.
AbeBooks Seller since November 22, 2018
Condition: New
Quantity: 4 available
Add to basketPrint on Demand pp. 124.
Seller Inventory # 26391719350
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.
"About this title" may belong to another edition of this title.
We accept return for those books which are received damaged. Though we take appropriate care in packing to avoid such situation.
| Order quantity | 12 to 19 business days | 12 to 14 business days |
|---|---|---|
| First item | US$ 3.99 | US$ 6.99 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.