Combinatorial Methods for String Processing
Sold by Majestic Books, Hounslow, United Kingdom
AbeBooks Seller since January 19, 2007
New - Hardcover
Condition: New
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Add to basketSold by Majestic Books, Hounslow, United Kingdom
AbeBooks Seller since January 19, 2007
Condition: New
Quantity: 4 available
Add to basketPrint on Demand pp. 124.
Seller Inventory # 388929129
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.
Returns accepted if you are not satisfied with the Service or Book.
Best packaging and fast delivery
| Order quantity | 14 to 45 business days | 5 to 10 business days |
|---|---|---|
| First item | US$ 8.71 | US$ 13.20 |
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.