Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Combinatorial Methods for String Processing

by Shunsuke Inenaga
Save 23% Save 23%
Current price ₹3,387.00
Original price ₹4,427.00
Original price ₹4,427.00
Original price ₹4,427.00
(-23%)
₹3,387.00
Current price ₹3,387.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9783036521947
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Mdpi AG
  • Publisher Imprint: Mdpi AG
  • Publication Date:
  • Pages: 124
  • Original Price: GBP 34.99
  • Language: English
  • Edition: N/A
  • Item Weight: 481 grams
  • BISAC Subject(s): General

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us